./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_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_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 --- 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 02:29:51,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:29:51,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:29:51,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:29:51,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:29:51,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:29:51,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:29:51,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:29:51,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:29:51,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:29:51,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:29:51,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:29:51,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:29:51,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:29:51,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:29:51,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:29:51,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:29:51,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:29:51,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:29:51,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:29:51,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:29:51,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:29:51,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:29:51,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:29:51,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:29:51,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:29:51,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:29:52,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:29:52,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:29:52,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:29:52,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:29:52,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:29:52,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:29:52,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:29:52,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:29:52,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:29:52,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:29:52,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:29:52,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:29:52,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:29:52,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:29:52,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 02:29:52,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:29:52,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:29:52,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:29:52,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:29:52,039 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:29:52,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:29:52,040 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:29:52,040 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:29:52,040 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:29:52,040 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:29:52,041 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:29:52,055 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:29:52,056 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:29:52,056 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:29:52,056 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:29:52,056 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:29:52,057 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:29:52,057 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:29:52,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:29:52,058 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:29:52,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:29:52,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:29:52,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:29:52,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:29:52,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:29:52,059 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:29:52,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:29:52,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:29:52,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:29:52,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:29:52,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:29:52,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:29:52,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:29:52,061 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:29:52,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:29:52,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:29:52,061 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:29:52,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:29:52,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:29:52,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:29:52,062 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_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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 -> 544427bc529e2c0f20a946d0ff425ec392089e48ebfc4e3308da2aa6ad8905e4 [2022-11-22 02:29:52,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:29:52,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:29:52,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:29:52,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:29:52,345 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:29:52,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-11-22 02:29:55,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:29:55,831 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:29:55,837 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-11-22 02:29:55,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/data/864141437/014ce053e0c6464387e5d65c1fc4fd82/FLAG68c24aacc [2022-11-22 02:29:55,880 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/data/864141437/014ce053e0c6464387e5d65c1fc4fd82 [2022-11-22 02:29:55,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:29:55,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:29:55,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:29:55,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:29:55,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:29:55,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:55" (1/1) ... [2022-11-22 02:29:55,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b69aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:55, skipping insertion in model container [2022-11-22 02:29:55,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:29:55" (1/1) ... [2022-11-22 02:29:55,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:29:55,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:29:56,382 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 02:29:56,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:29:56,864 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:29:56,894 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 02:29:56,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:29:57,091 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:29:57,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57 WrapperNode [2022-11-22 02:29:57,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:29:57,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:29:57,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:29:57,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:29:57,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,209 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-11-22 02:29:57,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:29:57,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:29:57,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:29:57,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:29:57,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:29:57,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:29:57,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:29:57,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:29:57,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (1/1) ... [2022-11-22 02:29:57,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:29:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:57,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:29:57,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:29:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 02:29:57,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 02:29:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-22 02:29:57,346 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 02:29:57,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:29:57,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-11-22 02:29:57,347 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-11-22 02:29:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:29:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-11-22 02:29:57,348 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-11-22 02:29:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 02:29:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:29:57,495 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:29:57,497 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:29:57,866 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:29:57,948 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:29:57,948 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:29:57,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:57 BoogieIcfgContainer [2022-11-22 02:29:57,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:29:57,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:29:57,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:29:57,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:29:57,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:29:55" (1/3) ... [2022-11-22 02:29:57,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc3ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:57, skipping insertion in model container [2022-11-22 02:29:57,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:29:57" (2/3) ... [2022-11-22 02:29:57,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc3ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:29:57, skipping insertion in model container [2022-11-22 02:29:57,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:57" (3/3) ... [2022-11-22 02:29:57,961 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_multiply_08_good.i [2022-11-22 02:29:57,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:29:57,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 02:29:58,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:29:58,039 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;@41dff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:29:58,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 02:29:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 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 02:29:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:29:58,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:58,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:29:58,055 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 02:29:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1213796289, now seen corresponding path program 1 times [2022-11-22 02:29:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458551145] [2022-11-22 02:29:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:58,463 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 02:29:58,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:58,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458551145] [2022-11-22 02:29:58,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458551145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:29:58,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:29:58,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:29:58,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268825314] [2022-11-22 02:29:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:58,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:29:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:29:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:29:58,508 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 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 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 02:29:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:58,603 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-11-22 02:29:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:29:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-11-22 02:29:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:58,614 INFO L225 Difference]: With dead ends: 145 [2022-11-22 02:29:58,615 INFO L226 Difference]: Without dead ends: 72 [2022-11-22 02:29:58,618 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 02:29:58,621 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 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 02:29:58,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:29:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-22 02:29:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-22 02:29:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 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 02:29:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-11-22 02:29:58,670 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-11-22 02:29:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:58,671 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-11-22 02:29:58,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 02:29:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-11-22 02:29:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:29:58,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:58,674 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 02:29:58,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:29:58,674 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 02:29:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1718655748, now seen corresponding path program 1 times [2022-11-22 02:29:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:58,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077058001] [2022-11-22 02:29:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:58,825 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 02:29:58,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:58,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077058001] [2022-11-22 02:29:58,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077058001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:29:58,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:29:58,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:29:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121912390] [2022-11-22 02:29:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:58,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:29:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:29:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:29:58,835 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 02:29:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:58,892 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2022-11-22 02:29:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:29:58,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 20 [2022-11-22 02:29:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:58,895 INFO L225 Difference]: With dead ends: 115 [2022-11-22 02:29:58,895 INFO L226 Difference]: Without dead ends: 114 [2022-11-22 02:29:58,895 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 02:29:58,897 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 43 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:58,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 225 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:29:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-22 02:29:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2022-11-22 02:29:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 57 states have internal predecessors, (60), 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 02:29:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-11-22 02:29:58,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 20 [2022-11-22 02:29:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:58,912 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-11-22 02:29:58,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 02:29:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-11-22 02:29:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:29:58,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:58,914 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, 1] [2022-11-22 02:29:58,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:29:58,914 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 02:29:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:58,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1738720556, now seen corresponding path program 1 times [2022-11-22 02:29:58,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:58,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996675019] [2022-11-22 02:29:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:58,999 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 02:29:58,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996675019] [2022-11-22 02:29:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996675019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:29:59,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:29:59,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:29:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867049864] [2022-11-22 02:29:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:59,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:29:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:29:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:29:59,007 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 02:29:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:59,085 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-11-22 02:29:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:29:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2022-11-22 02:29:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:59,094 INFO L225 Difference]: With dead ends: 173 [2022-11-22 02:29:59,095 INFO L226 Difference]: Without dead ends: 120 [2022-11-22 02:29:59,096 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 02:29:59,098 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:59,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 183 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:29:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-22 02:29:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 76. [2022-11-22 02:29:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-22 02:29:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-11-22 02:29:59,133 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-11-22 02:29:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:59,134 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-11-22 02:29:59,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 02:29:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-11-22 02:29:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-22 02:29:59,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:59,136 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 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 02:29:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:29:59,137 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 02:29:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -134839580, now seen corresponding path program 1 times [2022-11-22 02:29:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:59,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539593891] [2022-11-22 02:29:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:29:59,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:59,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539593891] [2022-11-22 02:29:59,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539593891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:59,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462069680] [2022-11-22 02:29:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:59,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:59,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:29:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:59,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:29:59,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:29:59,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:29:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462069680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:29:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:29:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-22 02:29:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877736999] [2022-11-22 02:29:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:29:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:29:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:29:59,532 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 02:29:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:59,575 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-11-22 02:29:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:29:59,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-11-22 02:29:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:59,578 INFO L225 Difference]: With dead ends: 146 [2022-11-22 02:29:59,578 INFO L226 Difference]: Without dead ends: 106 [2022-11-22 02:29:59,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:29:59,580 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:29:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-22 02:29:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-11-22 02:29:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 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 02:29:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-11-22 02:29:59,599 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-11-22 02:29:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:59,599 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-11-22 02:29:59,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-22 02:29:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-11-22 02:29:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:29:59,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:59,601 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 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 02:29:59,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:29:59,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:59,808 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 02:29:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 7536895, now seen corresponding path program 1 times [2022-11-22 02:29:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546520110] [2022-11-22 02:29:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:29:59,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:59,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546520110] [2022-11-22 02:29:59,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546520110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:29:59,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:29:59,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:29:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876046142] [2022-11-22 02:29:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:59,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:29:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:29:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:29:59,870 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 02:29:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:59,916 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-11-22 02:29:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:29:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-11-22 02:29:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:59,919 INFO L225 Difference]: With dead ends: 106 [2022-11-22 02:29:59,920 INFO L226 Difference]: Without dead ends: 105 [2022-11-22 02:29:59,921 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 02:29:59,922 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:59,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 198 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:29:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-22 02:29:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-11-22 02:29:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 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 02:29:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-11-22 02:29:59,941 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-11-22 02:29:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:59,941 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-11-22 02:29:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 02:29:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-11-22 02:29:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:29:59,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:59,943 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:29:59,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:29:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 233643865, now seen corresponding path program 1 times [2022-11-22 02:29:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:59,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84625315] [2022-11-22 02:29:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:30:00,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:00,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84625315] [2022-11-22 02:30:00,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84625315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:00,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:30:00,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:30:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093782494] [2022-11-22 02:30:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:00,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:30:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:00,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:30:00,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:30:00,044 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 02:30:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:00,088 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-11-22 02:30:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:30:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-22 02:30:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:00,092 INFO L225 Difference]: With dead ends: 105 [2022-11-22 02:30:00,092 INFO L226 Difference]: Without dead ends: 104 [2022-11-22 02:30:00,093 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 02:30:00,097 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:00,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 187 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-22 02:30:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-11-22 02:30:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 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 02:30:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-11-22 02:30:00,118 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-11-22 02:30:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:00,118 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-11-22 02:30:00,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-22 02:30:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-11-22 02:30:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-22 02:30:00,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:00,120 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 02:30:00,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:30:00,121 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1168894102, now seen corresponding path program 1 times [2022-11-22 02:30:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:00,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320813940] [2022-11-22 02:30:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:30:00,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320813940] [2022-11-22 02:30:00,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320813940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358963994] [2022-11-22 02:30:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:00,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:00,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:00,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:00,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:30:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:00,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:30:00,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:30:00,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:00,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358963994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:00,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:00,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:30:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680620466] [2022-11-22 02:30:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:00,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:30:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:00,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:30:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:00,414 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 02:30:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:00,455 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2022-11-22 02:30:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:30:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-11-22 02:30:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:00,457 INFO L225 Difference]: With dead ends: 111 [2022-11-22 02:30:00,457 INFO L226 Difference]: Without dead ends: 97 [2022-11-22 02:30:00,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:00,459 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:00,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-22 02:30:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2022-11-22 02:30:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-22 02:30:00,487 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 42 [2022-11-22 02:30:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:00,487 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-22 02:30:00,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 02:30:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-22 02:30:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-22 02:30:00,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:00,493 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-22 02:30:00,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:00,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:00,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1875978641, now seen corresponding path program 1 times [2022-11-22 02:30:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:00,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192930591] [2022-11-22 02:30:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-22 02:30:00,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:00,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192930591] [2022-11-22 02:30:00,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192930591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:00,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212439660] [2022-11-22 02:30:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:00,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:00,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:00,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:00,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:30:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:00,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:30:00,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-22 02:30:00,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:00,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212439660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:00,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:00,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:30:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575556321] [2022-11-22 02:30:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:30:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:30:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:00,925 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 02:30:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:00,951 INFO L93 Difference]: Finished difference Result 84 states and 116 transitions. [2022-11-22 02:30:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:30:00,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-11-22 02:30:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:00,952 INFO L225 Difference]: With dead ends: 84 [2022-11-22 02:30:00,953 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 02:30:00,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:00,954 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:00,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 02:30:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-22 02:30:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 63 states have internal predecessors, (73), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2022-11-22 02:30:00,961 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 43 [2022-11-22 02:30:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:00,962 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2022-11-22 02:30:00,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-22 02:30:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2022-11-22 02:30:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:30:00,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:00,964 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] [2022-11-22 02:30:00,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-22 02:30:01,170 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 02:30:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash -659810818, now seen corresponding path program 1 times [2022-11-22 02:30:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:01,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424667784] [2022-11-22 02:30:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:30:01,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:01,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424667784] [2022-11-22 02:30:01,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424667784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:01,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192389457] [2022-11-22 02:30:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:01,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:01,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:01,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:01,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:30:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:01,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:30:01,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-22 02:30:01,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:01,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192389457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:01,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:01,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-22 02:30:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921042436] [2022-11-22 02:30:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:01,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:30:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:30:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:01,443 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 02:30:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:01,479 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-11-22 02:30:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:30:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 45 [2022-11-22 02:30:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:01,482 INFO L225 Difference]: With dead ends: 111 [2022-11-22 02:30:01,483 INFO L226 Difference]: Without dead ends: 92 [2022-11-22 02:30:01,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:01,487 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:01,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-22 02:30:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-11-22 02:30:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-11-22 02:30:01,497 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 45 [2022-11-22 02:30:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:01,497 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-11-22 02:30:01,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-22 02:30:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-11-22 02:30:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 02:30:01,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:01,504 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-22 02:30:01,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:01,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 02:30:01,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1416369249, now seen corresponding path program 1 times [2022-11-22 02:30:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360834386] [2022-11-22 02:30:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:01,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360834386] [2022-11-22 02:30:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360834386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570021949] [2022-11-22 02:30:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:01,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:01,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:30:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:01,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:30:01,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-22 02:30:01,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:01,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570021949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:01,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:01,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:30:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681547482] [2022-11-22 02:30:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:01,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:30:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:30:01,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:01,944 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-22 02:30:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:01,965 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. [2022-11-22 02:30:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:30:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 52 [2022-11-22 02:30:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:01,967 INFO L225 Difference]: With dead ends: 81 [2022-11-22 02:30:01,967 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:30:01,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:30:01,968 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:01,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:30:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-22 02:30:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 60 states have internal predecessors, (69), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2022-11-22 02:30:01,975 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 52 [2022-11-22 02:30:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:01,975 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2022-11-22 02:30:01,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-22 02:30:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2022-11-22 02:30:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-22 02:30:01,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:01,976 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-22 02:30:01,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:02,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:30:02,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -957773578, now seen corresponding path program 1 times [2022-11-22 02:30:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:02,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640306133] [2022-11-22 02:30:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:02,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640306133] [2022-11-22 02:30:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640306133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090611776] [2022-11-22 02:30:02,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:02,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:02,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:30:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:02,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:30:02,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:30:02,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090611776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:02,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:02,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 02:30:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267972403] [2022-11-22 02:30:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:02,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:30:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:02,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:30:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:30:02,408 INFO L87 Difference]: Start difference. First operand 80 states and 111 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:02,448 INFO L93 Difference]: Finished difference Result 118 states and 156 transitions. [2022-11-22 02:30:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:30:02,449 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2022-11-22 02:30:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:02,450 INFO L225 Difference]: With dead ends: 118 [2022-11-22 02:30:02,451 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:30:02,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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 02:30:02,452 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 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 02:30:02,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:30:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-22 02:30:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-11-22 02:30:02,460 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 53 [2022-11-22 02:30:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:02,461 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-11-22 02:30:02,461 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-11-22 02:30:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-22 02:30:02,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:02,462 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-22 02:30:02,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:02,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 02:30:02,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 635599291, now seen corresponding path program 1 times [2022-11-22 02:30:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:02,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856657888] [2022-11-22 02:30:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:02,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856657888] [2022-11-22 02:30:02,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856657888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:02,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832468534] [2022-11-22 02:30:02,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:02,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:02,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:02,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:02,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:30:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:02,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:30:02,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 02:30:02,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:02,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832468534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:02,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:02,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 02:30:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557633375] [2022-11-22 02:30:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:02,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:30:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:30:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:30:02,887 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:02,921 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2022-11-22 02:30:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:30:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-11-22 02:30:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:02,922 INFO L225 Difference]: With dead ends: 114 [2022-11-22 02:30:02,922 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:30:02,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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 02:30:02,923 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 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 02:30:02,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:30:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-22 02:30:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 60 states have internal predecessors, (66), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-11-22 02:30:02,951 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 55 [2022-11-22 02:30:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:02,952 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-11-22 02:30:02,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-11-22 02:30:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-22 02:30:02,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:02,953 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-22 02:30:02,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:30:03,160 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1895142718, now seen corresponding path program 1 times [2022-11-22 02:30:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:03,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598203639] [2022-11-22 02:30:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:03,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598203639] [2022-11-22 02:30:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598203639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570048169] [2022-11-22 02:30:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:03,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:03,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:03,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:03,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:30:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:03,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:30:03,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:30:03,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:30:03,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570048169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:03,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:30:03,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 02:30:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308438491] [2022-11-22 02:30:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:03,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:30:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:30:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:30:03,396 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:03,428 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-11-22 02:30:03,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:30:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-11-22 02:30:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:03,429 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:30:03,430 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:30:03,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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 02:30:03,430 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 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 02:30:03,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:30:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-22 02:30:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 60 states have internal predecessors, (64), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-22 02:30:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2022-11-22 02:30:03,437 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 56 [2022-11-22 02:30:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:03,437 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-11-22 02:30:03,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:30:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-11-22 02:30:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-22 02:30:03,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:03,439 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-11-22 02:30:03,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:03,645 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -952828877, now seen corresponding path program 1 times [2022-11-22 02:30:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:03,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518645661] [2022-11-22 02:30:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 02:30:03,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:03,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518645661] [2022-11-22 02:30:03,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518645661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:03,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:30:03,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:30:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170621490] [2022-11-22 02:30:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:03,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:30:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:30:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:30:03,712 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 02:30:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:03,736 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-11-22 02:30:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:30:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 60 [2022-11-22 02:30:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:03,738 INFO L225 Difference]: With dead ends: 94 [2022-11-22 02:30:03,738 INFO L226 Difference]: Without dead ends: 75 [2022-11-22 02:30:03,738 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 02:30:03,739 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 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 02:30:03,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:30:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-22 02:30:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-22 02:30:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-22 02:30:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-11-22 02:30:03,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 60 [2022-11-22 02:30:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:03,745 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-11-22 02:30:03,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 02:30:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-11-22 02:30:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-22 02:30:03,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:03,746 INFO L195 NwaCegarLoop]: trace histogram [6, 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 02:30:03,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:30:03,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -558875546, now seen corresponding path program 1 times [2022-11-22 02:30:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:03,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18984335] [2022-11-22 02:30:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:03,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:03,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18984335] [2022-11-22 02:30:03,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18984335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:03,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015531467] [2022-11-22 02:30:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:03,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:03,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:03,845 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:03,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:30:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:03,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:30:03,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:04,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:30:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-22 02:30:04,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015531467] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:30:04,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [424335425] [2022-11-22 02:30:04,195 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-22 02:30:04,195 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:30:04,199 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:30:04,204 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:30:04,205 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:30:04,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:04,763 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 02:30:04,764 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 02:30:04,802 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 02:30:04,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:04,852 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 02:30:04,852 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 02:30:04,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:05,096 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:30:05,097 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 02:30:05,133 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 02:30:05,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:05,305 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 02:30:06,218 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 02:30:06,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,282 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:30:06,283 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 02:30:06,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,610 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:30:06,611 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 02:30:06,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:30:06,667 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 02:30:06,734 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 02:30:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:06,882 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 02:30:09,749 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:30:09,754 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-22 02:30:09,791 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:30:09,930 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-22 02:30:09,942 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:30:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [424335425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:30:21,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:30:21,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-11-22 02:30:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663844448] [2022-11-22 02:30:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:30:21,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 02:30:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:30:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 02:30:21,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-11-22 02:30:21,907 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-22 02:30:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:30:48,003 INFO L93 Difference]: Finished difference Result 304 states and 377 transitions. [2022-11-22 02:30:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-22 02:30:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-11-22 02:30:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:30:48,005 INFO L225 Difference]: With dead ends: 304 [2022-11-22 02:30:48,005 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 02:30:48,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 143 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=913, Invalid=5567, Unknown=0, NotChecked=0, Total=6480 [2022-11-22 02:30:48,007 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 287 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:30:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 384 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-11-22 02:30:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 02:30:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2022-11-22 02:30:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 81 states have internal predecessors, (83), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-22 02:30:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-11-22 02:30:48,038 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 62 [2022-11-22 02:30:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:30:48,039 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-11-22 02:30:48,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-22 02:30:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-11-22 02:30:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-22 02:30:48,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:30:48,040 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:30:48,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:30:48,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 02:30:48,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:30:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:30:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1931252352, now seen corresponding path program 1 times [2022-11-22 02:30:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:30:48,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540500773] [2022-11-22 02:30:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:30:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:30:48,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:30:48,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540500773] [2022-11-22 02:30:48,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540500773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:30:48,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222247108] [2022-11-22 02:30:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:30:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:30:48,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:30:48,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:30:48,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:30:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:30:48,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:30:48,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:30:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:30:48,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:30:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:30:48,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222247108] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:30:48,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2023528940] [2022-11-22 02:30:48,671 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-22 02:30:48,672 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:30:48,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:30:48,673 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:30:48,673 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:30:48,898 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 02:30:48,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,083 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:30:49,084 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 02:30:49,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,131 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 02:30:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,157 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 02:30:49,183 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 02:30:49,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,251 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 02:30:49,925 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 02:30:49,943 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 02:30:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:49,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,004 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:30:50,005 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 02:30:50,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,072 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:30:50,073 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 02:30:50,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,138 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 02:30:50,138 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 02:30:50,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:30:50,385 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-22 02:30:50,385 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 02:31:00,853 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:31:00,855 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 210 for LOIs [2022-11-22 02:31:00,976 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-11-22 02:31:00,978 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 64 for LOIs [2022-11-22 02:31:00,995 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:31:22,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2023528940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:22,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:31:22,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-11-22 02:31:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119563046] [2022-11-22 02:31:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:22,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 02:31:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 02:31:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2022-11-22 02:31:22,462 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:31:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:35,471 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-11-22 02:31:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-22 02:31:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 66 [2022-11-22 02:31:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:35,474 INFO L225 Difference]: With dead ends: 202 [2022-11-22 02:31:35,474 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 02:31:35,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 145 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2022-11-22 02:31:35,476 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 182 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:31:35,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 362 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-22 02:31:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 02:31:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2022-11-22 02:31:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.077922077922078) internal successors, (83), 81 states have internal predecessors, (83), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-22 02:31:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-11-22 02:31:35,502 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 66 [2022-11-22 02:31:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:35,502 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-11-22 02:31:35,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:31:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-11-22 02:31:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-22 02:31:35,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:35,503 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:35,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:31:35,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:31:35,709 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:31:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1745234924, now seen corresponding path program 1 times [2022-11-22 02:31:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:35,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845805820] [2022-11-22 02:31:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:31:35,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:35,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845805820] [2022-11-22 02:31:35,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845805820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:31:35,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252267089] [2022-11-22 02:31:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:35,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:35,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:31:35,843 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:31:35,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:31:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:35,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:31:35,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:31:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:31:36,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:31:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:31:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252267089] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:31:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751172] [2022-11-22 02:31:36,099 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-22 02:31:36,099 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:31:36,100 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:31:36,100 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:31:36,100 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:31:36,309 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 02:31:36,316 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 02:31:36,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:36,348 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 02:31:36,349 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 02:31:36,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:36,508 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 02:31:36,508 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 02:31:36,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:36,753 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:31:36,753 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 02:31:36,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:36,849 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 02:31:37,654 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 02:31:37,661 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 02:31:37,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,709 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:31:37,709 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 02:31:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,938 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:31:37,938 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 02:31:37,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:37,994 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:31:37,994 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 02:31:38,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:38,147 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 02:31:40,495 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:31:40,497 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-22 02:31:40,525 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:31:40,624 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-22 02:31:40,736 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:31:54,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [751172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:54,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:31:54,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-22 02:31:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130083560] [2022-11-22 02:31:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:54,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:31:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:54,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:31:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:31:54,623 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:32:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:32:07,657 INFO L93 Difference]: Finished difference Result 219 states and 255 transitions. [2022-11-22 02:32:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-22 02:32:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 66 [2022-11-22 02:32:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:32:07,659 INFO L225 Difference]: With dead ends: 219 [2022-11-22 02:32:07,659 INFO L226 Difference]: Without dead ends: 170 [2022-11-22 02:32:07,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=466, Invalid=2840, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 02:32:07,661 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 212 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:32:07,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 411 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-22 02:32:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-22 02:32:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2022-11-22 02:32:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.0666666666666667) internal successors, (112), 110 states have internal predecessors, (112), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-22 02:32:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2022-11-22 02:32:07,710 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 66 [2022-11-22 02:32:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:32:07,710 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2022-11-22 02:32:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:32:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-11-22 02:32:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-22 02:32:07,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:32:07,712 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:32:07,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:32:07,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 02:32:07,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:32:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:32:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1201815946, now seen corresponding path program 1 times [2022-11-22 02:32:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:32:07,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562406505] [2022-11-22 02:32:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:32:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:08,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:32:08,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562406505] [2022-11-22 02:32:08,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562406505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:32:08,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208424186] [2022-11-22 02:32:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:08,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:32:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:32:08,067 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:32:08,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 02:32:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:08,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:32:08,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:32:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:08,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:32:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:08,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208424186] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:32:08,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [548853336] [2022-11-22 02:32:08,333 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-22 02:32:08,333 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:32:08,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:32:08,334 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:32:08,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:32:08,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:08,696 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 02:32:08,696 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 02:32:08,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:08,895 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:32:08,895 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 02:32:08,936 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 02:32:08,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:08,952 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 02:32:08,967 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 02:32:09,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,040 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 02:32:09,612 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 02:32:09,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,656 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:32:09,657 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 02:32:09,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,899 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:32:09,900 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 02:32:09,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:09,947 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:32:09,947 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 02:32:10,005 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 02:32:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:10,125 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 02:32:12,810 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:32:12,813 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-11-22 02:32:12,931 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:32:13,034 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-22 02:32:13,048 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:32:27,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [548853336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:32:27,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:32:27,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-11-22 02:32:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448566453] [2022-11-22 02:32:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:32:27,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:32:27,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:32:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:32:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:32:27,963 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:32:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:32:43,156 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2022-11-22 02:32:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-22 02:32:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 68 [2022-11-22 02:32:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:32:43,157 INFO L225 Difference]: With dead ends: 198 [2022-11-22 02:32:43,157 INFO L226 Difference]: Without dead ends: 117 [2022-11-22 02:32:43,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 157 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-11-22 02:32:43,159 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 178 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:32:43,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 315 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-22 02:32:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-22 02:32:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-22 02:32:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 81 states have internal predecessors, (82), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-22 02:32:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2022-11-22 02:32:43,193 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 68 [2022-11-22 02:32:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:32:43,193 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2022-11-22 02:32:43,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:32:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2022-11-22 02:32:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-22 02:32:43,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:32:43,194 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:32:43,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:32:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 02:32:43,400 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:32:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:32:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1858287266, now seen corresponding path program 1 times [2022-11-22 02:32:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:32:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252423059] [2022-11-22 02:32:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:32:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:43,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:32:43,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252423059] [2022-11-22 02:32:43,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252423059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:32:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830323773] [2022-11-22 02:32:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:43,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:32:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:32:43,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:32:43,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 02:32:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:43,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:32:43,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:32:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:43,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:32:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:32:43,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830323773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:32:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750943446] [2022-11-22 02:32:43,789 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-22 02:32:43,789 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:32:43,791 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:32:43,792 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:32:43,792 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:32:43,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:44,011 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 02:32:44,012 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 02:32:44,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:44,223 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:32:44,224 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 02:32:44,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:44,257 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 02:32:44,299 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 02:32:44,309 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 02:32:44,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:44,380 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 02:32:45,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,359 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:32:45,360 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 02:32:45,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,428 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:32:45,429 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 02:32:45,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,576 INFO L321 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-11-22 02:32:45,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 85 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 12 case distinctions, treesize of input 77 treesize of output 137 [2022-11-22 02:32:45,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 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 02:32:45,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 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 02:32:45,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:45,811 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-22 02:32:45,812 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 161 treesize of output 209 [2022-11-22 02:32:46,768 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:32:46,770 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 183 for LOIs [2022-11-22 02:32:46,850 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-11-22 02:32:46,916 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-22 02:32:46,943 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:32:56,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1750943446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:32:56,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:32:56,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-11-22 02:32:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948957844] [2022-11-22 02:32:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:32:56,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:32:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:32:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:32:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1669, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:32:56,283 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:33:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:33:10,413 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-11-22 02:33:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-22 02:33:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 68 [2022-11-22 02:33:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:33:10,415 INFO L225 Difference]: With dead ends: 166 [2022-11-22 02:33:10,415 INFO L226 Difference]: Without dead ends: 115 [2022-11-22 02:33:10,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 155 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=605, Invalid=3555, Unknown=0, NotChecked=0, Total=4160 [2022-11-22 02:33:10,417 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 189 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:33:10,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 560 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-22 02:33:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-22 02:33:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-11-22 02:33:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 75 states have internal predecessors, (75), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-22 02:33:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-11-22 02:33:10,448 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 68 [2022-11-22 02:33:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:33:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-11-22 02:33:10,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-22 02:33:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-11-22 02:33:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-22 02:33:10,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:33:10,450 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, 1] [2022-11-22 02:33:10,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-22 02:33:10,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:33:10,663 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:33:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:33:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1185504466, now seen corresponding path program 1 times [2022-11-22 02:33:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:33:10,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546997638] [2022-11-22 02:33:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:33:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:10,774 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 02:33:10,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:33:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546997638] [2022-11-22 02:33:10,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546997638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:33:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095106808] [2022-11-22 02:33:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:10,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:33:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:33:10,776 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:33:10,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 02:33:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:10,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:33:10,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:33:10,944 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 02:33:10,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:33:11,019 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 02:33:11,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095106808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:33:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1670187078] [2022-11-22 02:33:11,023 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-22 02:33:11,023 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:33:11,024 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:33:11,024 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:33:11,024 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:33:11,232 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 02:33:11,240 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 02:33:11,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:11,390 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 02:33:11,390 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 02:33:11,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:11,446 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 02:33:11,447 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 02:33:11,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:11,649 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:33:11,649 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 02:33:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:11,731 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 02:33:12,513 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 02:33:12,520 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 02:33:12,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,556 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:33:12,556 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 02:33:12,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,781 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:33:12,781 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 02:33:12,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,827 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:33:12,828 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 02:33:12,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:12,981 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 02:33:15,484 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:33:15,487 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-22 02:33:15,521 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:33:15,636 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-22 02:33:15,642 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:33:27,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1670187078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:33:27,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:33:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-11-22 02:33:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27970293] [2022-11-22 02:33:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:33:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:33:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:33:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:33:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2022-11-22 02:33:27,649 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 02:33:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:33:31,746 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-11-22 02:33:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-22 02:33:31,747 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 70 [2022-11-22 02:33:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:33:31,748 INFO L225 Difference]: With dead ends: 138 [2022-11-22 02:33:31,748 INFO L226 Difference]: Without dead ends: 112 [2022-11-22 02:33:31,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 02:33:31,750 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 194 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:33:31,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 173 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-22 02:33:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-22 02:33:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2022-11-22 02:33:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-22 02:33:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-11-22 02:33:31,791 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 70 [2022-11-22 02:33:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:33:31,792 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-11-22 02:33:31,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 02:33:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-11-22 02:33:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-22 02:33:31,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:33:31,793 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, 1, 1, 1, 1, 1] [2022-11-22 02:33:31,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 02:33:31,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-22 02:33:31,999 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:33:31,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:33:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -409280840, now seen corresponding path program 1 times [2022-11-22 02:33:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:33:32,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718329873] [2022-11-22 02:33:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:33:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:32,114 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 02:33:32,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:33:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718329873] [2022-11-22 02:33:32,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718329873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:33:32,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316671912] [2022-11-22 02:33:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:33:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:33:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:33:32,117 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:33:32,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 02:33:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:33:32,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:33:32,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:33:32,285 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 02:33:32,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:33:32,384 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 02:33:32,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316671912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:33:32,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281827248] [2022-11-22 02:33:32,386 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-22 02:33:32,386 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:33:32,386 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:33:32,387 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:33:32,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:33:32,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:32,721 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:33:32,721 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 02:33:32,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:32,757 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 02:33:32,780 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 02:33:32,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:32,792 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 02:33:32,808 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 02:33:32,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:32,867 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 02:33:33,586 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 02:33:33,594 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 02:33:33,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,632 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:33:33,632 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 02:33:33,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,686 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:33:33,687 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 02:33:33,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,833 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-22 02:33:33,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-22 02:33:33,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:33,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:33:34,033 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-22 02:33:34,034 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 157 treesize of output 205 [2022-11-22 02:33:46,849 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:33:46,850 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-11-22 02:33:46,852 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-11-22 02:33:46,854 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-22 02:33:46,962 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:13,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1281827248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:34:13,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:13,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-22 02:34:13,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948172039] [2022-11-22 02:34:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:34:13,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:34:13,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:13,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:34:13,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:34:13,035 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 2 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 02:34:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:15,582 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-11-22 02:34:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-22 02:34:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 2 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 72 [2022-11-22 02:34:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:15,583 INFO L225 Difference]: With dead ends: 112 [2022-11-22 02:34:15,583 INFO L226 Difference]: Without dead ends: 68 [2022-11-22 02:34:15,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 161 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-11-22 02:34:15,584 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 140 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:15,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 116 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-22 02:34:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-22 02:34:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-22 02:34:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-22 02:34:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-11-22 02:34:15,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 72 [2022-11-22 02:34:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:15,607 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-11-22 02:34:15,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 31 states have internal predecessors, (40), 12 states have call successors, (12), 2 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 02:34:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-11-22 02:34:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-22 02:34:15,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:15,608 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, 1, 1, 1, 1, 1] [2022-11-22 02:34:15,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 02:34:15,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:15,809 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:34:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1037442184, now seen corresponding path program 1 times [2022-11-22 02:34:15,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:15,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660883218] [2022-11-22 02:34:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:15,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:15,918 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 02:34:15,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660883218] [2022-11-22 02:34:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660883218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:34:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835121817] [2022-11-22 02:34:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:15,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:34:15,920 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:34:15,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 02:34:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:34:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:34:16,094 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 02:34:16,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:34:16,202 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 02:34:16,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835121817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:34:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104884722] [2022-11-22 02:34:16,208 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-22 02:34:16,208 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:34:16,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:34:16,209 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:34:16,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:34:16,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:16,547 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:34:16,547 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 02:34:16,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:16,592 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 02:34:16,612 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 02:34:16,623 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 02:34:16,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:16,636 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 02:34:16,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:16,690 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 02:34:17,550 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 02:34:17,559 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 02:34:17,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,627 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:34:17,628 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 02:34:17,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,871 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:34:17,872 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 02:34:17,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:17,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:34:17,928 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 02:34:18,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:18,097 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 02:34:20,681 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:34:20,683 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 215 for LOIs [2022-11-22 02:34:20,792 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:34:20,890 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-22 02:34:20,985 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:34:39,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1104884722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:34:39,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:34:39,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-11-22 02:34:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789629305] [2022-11-22 02:34:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:34:39,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-22 02:34:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:34:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-22 02:34:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 02:34:39,198 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 02:34:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:34:44,538 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-11-22 02:34:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-22 02:34:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 72 [2022-11-22 02:34:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:34:44,539 INFO L225 Difference]: With dead ends: 93 [2022-11-22 02:34:44,540 INFO L226 Difference]: Without dead ends: 67 [2022-11-22 02:34:44,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 02:34:44,541 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:34:44,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 117 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-22 02:34:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-22 02:34:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-22 02:34:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-22 02:34:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-11-22 02:34:44,564 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 72 [2022-11-22 02:34:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:34:44,565 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-11-22 02:34:44,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 02:34:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-11-22 02:34:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-22 02:34:44,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:34:44,566 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, 1, 1, 1, 1, 1] [2022-11-22 02:34:44,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:34:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 02:34:44,772 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:34:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:34:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 144651394, now seen corresponding path program 1 times [2022-11-22 02:34:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:34:44,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234234628] [2022-11-22 02:34:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:34:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:44,869 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 02:34:44,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:34:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234234628] [2022-11-22 02:34:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234234628] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:34:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474439521] [2022-11-22 02:34:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:34:44,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:34:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:34:44,872 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:34:44,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 02:34:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:34:45,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:34:45,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:34:45,047 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 02:34:45,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:34:45,130 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 02:34:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474439521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:34:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600315026] [2022-11-22 02:34:45,132 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-22 02:34:45,132 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:34:45,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:34:45,132 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:34:45,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:34:45,341 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 02:34:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:45,371 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-22 02:34:45,372 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 02:34:45,387 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 02:34:45,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:45,547 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-22 02:34:45,548 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 02:34:45,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:45,768 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-22 02:34:45,769 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 02:34:45,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:45,859 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 02:34:46,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,727 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-22 02:34:46,727 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 02:34:46,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:46,960 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-22 02:34:46,960 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 02:34:47,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:47,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:47,019 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:34:47,019 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 02:34:47,073 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 02:34:47,085 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 02:34:47,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:34:47,204 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 02:34:50,133 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-22 02:34:50,135 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-11-22 02:34:50,137 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-22 02:34:50,235 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-22 02:34:50,245 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:35:06,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [600315026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:35:06,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:35:06,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 44 [2022-11-22 02:35:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138932731] [2022-11-22 02:35:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:35:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-22 02:35:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:35:06,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-22 02:35:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-11-22 02:35:06,504 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 02:35:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:35:09,038 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-22 02:35:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-22 02:35:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 74 [2022-11-22 02:35:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:35:09,039 INFO L225 Difference]: With dead ends: 67 [2022-11-22 02:35:09,039 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:35:09,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=339, Invalid=1823, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 02:35:09,040 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:35:09,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 62 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-22 02:35:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:35:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:35:09,041 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 02:35:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:35:09,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-11-22 02:35:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:35:09,041 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:35:09,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 02:35:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:35:09,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:35:09,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 02:35:09,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 02:35:09,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 02:35:09,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 02:35:09,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 02:35:09,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 02:35:09,045 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 02:35:09,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 02:35:09,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:35:09,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:35:09,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:35:21,362 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 545 DAG size of output: 326 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:35:30,645 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 544 DAG size of output: 325 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:35:39,878 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 537 DAG size of output: 287 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:35:46,609 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 548 DAG size of output: 323 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:36:00,450 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 535 DAG size of output: 318 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:36:00,455 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 02:36:00,455 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 02:36:00,455 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-11-22 02:36:00,455 INFO L902 garLoopResultBuilder]: At program point staticReturnsFalseENTRY(lines 1552 1555) the Hoare annotation is: true [2022-11-22 02:36:00,455 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 02:36:00,455 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1591) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1574 1592) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:36:00,456 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-11-22 02:36:00,457 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) 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) (= 51 (select |#length| 8)) (= (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 |#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|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|) 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:36:00,457 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1625) no Hoare annotation was computed. [2022-11-22 02:36:00,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-11-22 02:36:00,458 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse47 (store ((as const (Array Int Int)) 0) 0 0))) (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)) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.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|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse47 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8))))) (.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 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.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 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .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|) .cse47) (< |#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 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 .cse38) .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)))) [2022-11-22 02:36:00,458 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-22 02:36:00,458 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1611) no Hoare annotation was computed. [2022-11-22 02:36:00,459 INFO L895 garLoopResultBuilder]: At program point L1598-4(lines 1598 1611) 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))) (.cse37 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 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|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= 51 (select |#length| 5))) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (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 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse37 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 (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|) .cse13) (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) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse37) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-11-22 02:36:00,459 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) 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))) (.cse38 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 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|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (<= (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|) 0)) (.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 (= 51 (select |#length| 5))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (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 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse38 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 (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|) .cse13) (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) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse38) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse45 .cse46 .cse47))) [2022-11-22 02:36:00,460 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1590) no Hoare annotation was computed. [2022-11-22 02:36:00,460 INFO L899 garLoopResultBuilder]: For program point L1640(line 1640) no Hoare annotation was computed. [2022-11-22 02:36:00,460 INFO L899 garLoopResultBuilder]: For program point L1640-1(lines 1640 1647) no Hoare annotation was computed. [2022-11-22 02:36:00,460 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-22 02:36:00,460 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1592) no Hoare annotation was computed. [2022-11-22 02:36:00,461 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: (let ((.cse64 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse65 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse52 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse52 (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))))) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (<= .cse65 0)) (.cse56 (< 0 .cse65)) (.cse61 (<= .cse64 0)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#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 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse51 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse60 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.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 (< 0 .cse64)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= 51 (select |#length| 5))) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse55 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse43 (= ~globalArgc~0 0)) (.cse63 (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|) .cse52) (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 (= (select |#valid| 6) 1)) (.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 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (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|) .cse52) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse42 .cse58 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse52) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse55 .cse58 .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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse54 .cse39 .cse40 .cse41 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse43 .cse62 .cse63 .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 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse61 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse57 .cse35 .cse36 .cse37 .cse38 .cse39 .cse58 .cse43 .cse62 .cse44 .cse45 .cse46 .cse47 .cse59 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse60 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse42 .cse43 .cse63 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)))) [2022-11-22 02:36:00,461 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2022-11-22 02:36:00,461 INFO L899 garLoopResultBuilder]: For program point L1632-2(lines 1632 1639) no Hoare annotation was computed. [2022-11-22 02:36:00,462 INFO L895 garLoopResultBuilder]: At program point L1632-3(lines 1632 1639) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse65 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse64 (store ((as const (Array Int Int)) 0) 0 0)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|))) (let ((.cse53 (< 0 .cse66)) (.cse54 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse21 (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|) .cse64) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10))))) (.cse22 (<= .cse65 0)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse57 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse48 (<= 0 .cse65)) (.cse61 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse64 (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))))) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse63 (<= .cse67 0)) (.cse60 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse52 (< 0 .cse67)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.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|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (<= .cse66 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse56 (= .cse65 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= 51 (select |#length| 5))) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse58 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse64 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.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 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse57 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse62 .cse63 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse54 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse57 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (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 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse61 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse64) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse60 .cse40 .cse41 .cse58 .cse42 .cse44 .cse45 .cse46 .cse47 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse56 .cse36 .cse37 .cse38 .cse39 .cse40 .cse58 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse59 .cse49 .cse50 .cse51)))) [2022-11-22 02:36:00,462 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-11-22 02:36:00,462 INFO L899 garLoopResultBuilder]: For program point L1657-1(lines 1657 1664) no Hoare annotation was computed. [2022-11-22 02:36:00,463 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1665) no Hoare annotation was computed. [2022-11-22 02:36:00,463 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1624) no Hoare annotation was computed. [2022-11-22 02:36:00,463 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) 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)) (.cse50 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 (= 51 (select |#length| 8))) (.cse11 (= (select |#valid| 11) 1)) (.cse12 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse13 (= (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))) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse17 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse18 (= (select |#valid| 3) 1)) (.cse19 (= 21 (select |#length| 4))) (.cse20 (= (select |#valid| 7) 1)) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= (select |#length| 10) 18)) (.cse24 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.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 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .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 .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 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse50 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 .cse50) .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-22 02:36:00,463 INFO L899 garLoopResultBuilder]: For program point L1608-1(lines 1602 1609) no Hoare annotation was computed. [2022-11-22 02:36:00,464 INFO L899 garLoopResultBuilder]: For program point L1584(line 1584) no Hoare annotation was computed. [2022-11-22 02:36:00,464 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2022-11-22 02:36:00,464 INFO L899 garLoopResultBuilder]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2022-11-22 02:36:00,464 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-11-22 02:36:00,464 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: false [2022-11-22 02:36:00,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-11-22 02:36:00,464 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-11-22 02:36:00,465 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) 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) (= 51 (select |#length| 8)) (= (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 |#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) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:36:00,465 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-11-22 02:36:00,465 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-11-22 02:36:00,466 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) 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) (= 51 (select |#length| 8)) (= (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 |#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|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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) (= 51 (select |#length| 5)) (= (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) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:36:00,466 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-22 02:36:00,467 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) 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 (+ 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= 51 (select |#length| 8)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1) 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 |#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|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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) (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 1) 1) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:36:00,467 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-22 02:36:00,467 INFO L895 garLoopResultBuilder]: At program point L1676(line 1676) 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) (= 51 (select |#length| 8)) (= (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 |#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) (= 51 (select |#length| 5)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:36:00,467 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-22 02:36:00,468 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1609) no Hoare annotation was computed. [2022-11-22 02:36:00,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:36:00,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-11-22 02:36:00,468 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1627) no Hoare annotation was computed. [2022-11-22 02:36:00,469 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) 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))) (.cse39 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823))) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.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 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1) 0)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= 51 (select |#length| 5))) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse14 (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)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= .cse39 0) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (< 0 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) .cse32 .cse33 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 (< 0 .cse39) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse41 .cse42 .cse43 .cse44 .cse45 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse46 .cse47 .cse48))) [2022-11-22 02:36:00,469 INFO L899 garLoopResultBuilder]: For program point L1644(line 1644) no Hoare annotation was computed. [2022-11-22 02:36:00,469 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2022-11-22 02:36:00,470 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) 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) (= 51 (select |#length| 8)) (= (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 |#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) (= 51 (select |#length| 5)) (= |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) (= 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 02:36:00,470 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-11-22 02:36:00,470 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-22 02:36:00,470 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-22 02:36:00,470 INFO L899 garLoopResultBuilder]: For program point L1628(lines 1628 1648) no Hoare annotation was computed. [2022-11-22 02:36:00,470 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-11-22 02:36:00,471 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: (let ((.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse52 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse22 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse55 (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|) .cse22) (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))))) (.cse56 (<= 0 .cse52)) (.cse53 (<= .cse68 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse66 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse22 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse60 (< 0 .cse67)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse65 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse57 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse22 (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 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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|)) (.cse61 (< 0 .cse68)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse36 (= .cse52 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse59 (<= .cse67 0)) (.cse64 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse44 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.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 (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|) .cse22) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .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 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse52 0) .cse23 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse54 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse58 .cse59 .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 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse64 .cse44 .cse55 .cse45 .cse46 .cse47 .cse48 .cse56 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse65 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse66 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse22) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse65 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse57 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse59 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-22 02:36:00,472 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-11-22 02:36:00,473 INFO L895 garLoopResultBuilder]: At program point L1653-4(lines 1653 1656) the Hoare annotation is: (let ((.cse66 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse68 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse52 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse23 (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))))) (.cse57 (< 0 .cse67)) (.cse62 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse55 (<= .cse68 0)) (.cse58 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse65 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse23 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse61 (< 0 .cse68)) (.cse63 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse66 0)) (.cse41 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse64 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.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 (= 51 (select |#length| 8))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse53 (<= .cse67 0)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse42 (= ~globalFalse~0 0)) (.cse43 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse44 (= ~globalArgc~0 0)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (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|) .cse23) (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 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse60 (<= 0 .cse66)) (.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 (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|) .cse23) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .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 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse54 .cse55 .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 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse58 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse58 .cse64 .cse44 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse52 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse57 .cse34 .cse35 .cse62 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse54 .cse55 .cse58 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse64 .cse44 .cse56 .cse45 .cse46 .cse47 .cse48 .cse65 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse61 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse23) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse63 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse64 .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 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= .cse66 0) .cse24 .cse25 .cse26 .cse53 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse56 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse49 .cse50 .cse51)))) [2022-11-22 02:36:00,473 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-22 02:36:00,474 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (let ((.cse54 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse66 (+ 1073741824 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse67 (+ 1073741824 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse61 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse62 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse34 (< |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse61 (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))))) (.cse64 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse65 (<= .cse67 0)) (.cse53 (<= 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse31 (< 0 .cse66)) (.cse57 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse59 (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|) .cse61) (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))))) (.cse60 (<= 0 .cse54)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (< 0 .cse67)) (.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 (= 51 (select |#length| 8))) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse56 (<= .cse66 0)) (.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|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= .cse54 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= 51 (select |#length| 5))) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse43 (< |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse44 (= ~globalArgc~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse61 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.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 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse54 0) .cse55 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse44 .cse58 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse61) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (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|) .cse61) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse62 .cse41 .cse64 .cse65 .cse57 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse64 .cse65 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse53 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse57 .cse42 .cse44 .cse59 .cse45 .cse46 .cse47 .cse48 .cse60 .cse50 .cse51 .cse52) (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 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse58 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-11-22 02:36:00,475 INFO L902 garLoopResultBuilder]: At program point L1678-1(line 1678) the Hoare annotation is: true [2022-11-22 02:36:00,475 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2022-11-22 02:36:00,475 INFO L899 garLoopResultBuilder]: For program point L1612-1(lines 1612 1626) no Hoare annotation was computed. [2022-11-22 02:36:00,475 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-22 02:36:00,475 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-11-22 02:36:00,475 INFO L902 garLoopResultBuilder]: At program point staticReturnsTrueENTRY(lines 1548 1551) the Hoare annotation is: true [2022-11-22 02:36:00,479 INFO L444 BasicCegarLoop]: Path program histogram: [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 02:36:00,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:36:00,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:36:00 BoogieIcfgContainer [2022-11-22 02:36:00,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:36:00,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:36:00,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:36:00,490 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:36:00,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:29:57" (3/4) ... [2022-11-22 02:36:00,493 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:36:00,497 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 02:36:00,497 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-11-22 02:36:00,497 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 02:36:00,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-11-22 02:36:00,502 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-22 02:36:00,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-22 02:36:00,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 02:36:00,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:36:00,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:36:00,563 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:36:00,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:36:00,564 INFO L158 Benchmark]: Toolchain (without parser) took 364678.16ms. Allocated memory was 174.1MB in the beginning and 574.6MB in the end (delta: 400.6MB). Free memory was 127.8MB in the beginning and 353.2MB in the end (delta: -225.4MB). Peak memory consumption was 179.3MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,564 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 174.1MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:36:00,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1200.17ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 137.8MB in the end (delta: -10.4MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.84ms. Allocated memory was 174.1MB in the beginning and 224.4MB in the end (delta: 50.3MB). Free memory was 137.8MB in the beginning and 191.2MB in the end (delta: -53.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,573 INFO L158 Benchmark]: Boogie Preprocessor took 44.46ms. Allocated memory is still 224.4MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,573 INFO L158 Benchmark]: RCFGBuilder took 696.18ms. Allocated memory is still 224.4MB. Free memory was 189.1MB in the beginning and 169.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,573 INFO L158 Benchmark]: TraceAbstraction took 362535.73ms. Allocated memory was 224.4MB in the beginning and 574.6MB in the end (delta: 350.2MB). Free memory was 168.2MB in the beginning and 357.4MB in the end (delta: -189.3MB). Peak memory consumption was 336.8MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,574 INFO L158 Benchmark]: Witness Printer took 73.74ms. Allocated memory is still 574.6MB. Free memory was 357.4MB in the beginning and 353.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:36:00,575 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.26ms. Allocated memory is still 174.1MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1200.17ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 137.8MB in the end (delta: -10.4MB). Peak memory consumption was 68.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.84ms. Allocated memory was 174.1MB in the beginning and 224.4MB in the end (delta: 50.3MB). Free memory was 137.8MB in the beginning and 191.2MB in the end (delta: -53.4MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.46ms. Allocated memory is still 224.4MB. Free memory was 191.2MB in the beginning and 189.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 696.18ms. Allocated memory is still 224.4MB. Free memory was 189.1MB in the beginning and 169.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 362535.73ms. Allocated memory was 224.4MB in the beginning and 574.6MB in the end (delta: 350.2MB). Free memory was 168.2MB in the beginning and 357.4MB in the end (delta: -189.3MB). Peak memory consumption was 336.8MB. Max. memory is 16.1GB. * Witness Printer took 73.74ms. Allocated memory is still 574.6MB. Free memory was 357.4MB in the beginning and 353.2MB 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: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 362.5s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 96.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 51.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2078 SdHoareTripleChecker+Valid, 39.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1840 mSDsluCounter, 5330 SdHoareTripleChecker+Invalid, 37.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3580 mSDsCounter, 774 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15585 IncrementalHoareTripleChecker+Invalid, 16359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 774 mSolverCounterUnsat, 1750 mSDtfsCounter, 15585 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2413 GetRequests, 1803 SyntacticMatches, 78 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8554 ImplicationChecksByTransitivity, 200.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=17, InterpolantAutomatonStates: 477, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 293 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 210 PreInvPairs, 321 NumberOfFragments, 18449 HoareAnnotationTreeSize, 210 FomulaSimplifications, 2850 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 25 FomulaSimplificationsInter, 84371 FormulaSimplificationTreeSizeReductionInter, 48.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2749 ConstructedInterpolants, 0 QuantifiedInterpolants, 3808 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4456 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 1303/1350 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: 59.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 45, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 552, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 384, TOOLS_POST_TIME: 25.4s, TOOLS_POST_CALL_APPLICATIONS: 306, TOOLS_POST_CALL_TIME: 17.5s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 9.9s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 894, TOOLS_QUANTIFIERELIM_TIME: 52.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1302, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 270, DOMAIN_JOIN_TIME: 5.0s, 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: 552, DOMAIN_ISBOTTOM_TIME: 1.5s, 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: 204, CALL_SUMMARIZER_CACHE_MISSES: 36, 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.2s, DAG_COMPRESSION_PROCESSED_NODES: 17636, DAG_COMPRESSION_RETAINED_NODES: 1329, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1678]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 02:36:00,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b07434a-c3b3-4d40-b659-54c502ba7d4a/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