./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_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_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/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_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/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_6fb73eff-ef28-4441-9ec0-556691710a12/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 7c0da28a3279531ae99c6f3d9af54307d4e61fead8521ccf951ebb6280d11476 --- 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:02:59,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:02:59,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:02:59,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:02:59,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:02:59,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:02:59,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:02:59,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:02:59,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:02:59,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:02:59,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:02:59,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:02:59,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:02:59,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:02:59,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:02:59,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:02:59,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:02:59,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:02:59,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:02:59,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:02:59,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:02:59,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:02:59,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:02:59,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:02:59,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:02:59,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:02:59,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:02:59,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:02:59,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:02:59,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:02:59,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:02:59,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:02:59,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:02:59,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:02:59,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:02:59,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:02:59,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:02:59,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:02:59,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:02:59,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:02:59,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:02:59,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 02:02:59,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:02:59,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:02:59,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:02:59,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:02:59,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:02:59,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:02:59,918 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:02:59,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:02:59,919 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:02:59,920 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:02:59,920 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:02:59,920 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:02:59,921 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:02:59,921 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:02:59,921 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:02:59,922 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:02:59,922 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:02:59,923 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:02:59,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:02:59,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:02:59,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:02:59,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:02:59,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:02:59,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:02:59,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:02:59,926 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:02:59,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:02:59,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:02:59,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:02:59,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:02:59,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:02:59,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:02:59,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:02:59,928 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:02:59,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:02:59,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:02:59,929 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:02:59,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:02:59,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:02:59,930 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:02:59,930 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_6fb73eff-ef28-4441-9ec0-556691710a12/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_6fb73eff-ef28-4441-9ec0-556691710a12/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 -> 7c0da28a3279531ae99c6f3d9af54307d4e61fead8521ccf951ebb6280d11476 [2022-11-22 02:03:00,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:03:00,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:03:00,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:03:00,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:03:00,275 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:03:00,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_good.i [2022-11-22 02:03:03,334 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:03:03,672 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:03:03,672 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_08_good.i [2022-11-22 02:03:03,694 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/data/046a44828/c64b6a520a4248bcb759e6bf308d102a/FLAGd5e9c8dbd [2022-11-22 02:03:03,709 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/data/046a44828/c64b6a520a4248bcb759e6bf308d102a [2022-11-22 02:03:03,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:03:03,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:03:03,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:03:03,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:03:03,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:03:03,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:03" (1/1) ... [2022-11-22 02:03:03,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b3fab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:03, skipping insertion in model container [2022-11-22 02:03:03,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:03" (1/1) ... [2022-11-22 02:03:03,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:03:03,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:03:04,240 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 02:03:04,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:03:04,904 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:03:04,927 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-22 02:03:04,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:03:05,192 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:03:05,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05 WrapperNode [2022-11-22 02:03:05,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:03:05,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:03:05,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:03:05,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:03:05,222 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:03:05" (1/1) ... [2022-11-22 02:03:05,256 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:03:05" (1/1) ... [2022-11-22 02:03:05,304 INFO L138 Inliner]: procedures = 505, calls = 77, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-22 02:03:05,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:03:05,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:03:05,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:03:05,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:03:05,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,366 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:03:05,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:03:05,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:03:05,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:03:05,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (1/1) ... [2022-11-22 02:03:05,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:03:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:05,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:03:05,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-22 02:03:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-22 02:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-22 02:03:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-22 02:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:03:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-11-22 02:03:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-11-22 02:03:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-11-22 02:03:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-11-22 02:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-22 02:03:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:03:05,721 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:03:05,724 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:03:06,030 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:03:06,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:03:06,201 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:03:06,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:06 BoogieIcfgContainer [2022-11-22 02:03:06,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:03:06,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:03:06,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:03:06,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:03:06,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:03:03" (1/3) ... [2022-11-22 02:03:06,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52760a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:06, skipping insertion in model container [2022-11-22 02:03:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:05" (2/3) ... [2022-11-22 02:03:06,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52760a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:06, skipping insertion in model container [2022-11-22 02:03:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:06" (3/3) ... [2022-11-22 02:03:06,216 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_08_good.i [2022-11-22 02:03:06,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:03:06,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-22 02:03:06,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:03:06,306 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;@11f891bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:03:06,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-22 02:03:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 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:03:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:03:06,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:06,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:06,323 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:03:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash 902927096, now seen corresponding path program 1 times [2022-11-22 02:03:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322596832] [2022-11-22 02:03:06,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:06,781 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:03:06,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322596832] [2022-11-22 02:03:06,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322596832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:06,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:03:06,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:03:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2544132] [2022-11-22 02:03:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:06,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:03:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:03:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:03:06,828 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:03:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:06,939 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2022-11-22 02:03:06,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:03:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2022-11-22 02:03:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:06,953 INFO L225 Difference]: With dead ends: 106 [2022-11-22 02:03:06,953 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 02:03:06,956 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:03:06,960 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:06,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:03:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 02:03:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2022-11-22 02:03:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.375) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 02:03:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-22 02:03:07,059 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 16 [2022-11-22 02:03:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:07,060 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-22 02:03:07,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:03:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-22 02:03:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:03:07,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:07,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:07,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:03:07,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2074031020, now seen corresponding path program 1 times [2022-11-22 02:03:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486138623] [2022-11-22 02:03:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:07,477 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:03:07,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:07,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486138623] [2022-11-22 02:03:07,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486138623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:07,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:03:07,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:03:07,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252567489] [2022-11-22 02:03:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:03:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:03:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:03:07,482 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:03:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:07,560 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-22 02:03:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:03:07,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-22 02:03:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:07,562 INFO L225 Difference]: With dead ends: 59 [2022-11-22 02:03:07,562 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:03:07,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:03:07,568 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:07,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:03:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:03:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-22 02:03:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.34375) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 02:03:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-22 02:03:07,580 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 17 [2022-11-22 02:03:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:07,581 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-22 02:03:07,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-22 02:03:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-22 02:03:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 02:03:07,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:07,589 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:07,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:03:07,590 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2055722937, now seen corresponding path program 1 times [2022-11-22 02:03:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:07,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850773791] [2022-11-22 02:03:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:03:07,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:07,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850773791] [2022-11-22 02:03:07,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850773791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:07,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:03:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:03:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291691108] [2022-11-22 02:03:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:07,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:03:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:03:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:03:07,777 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 02:03:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:07,850 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-11-22 02:03:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:03:07,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2022-11-22 02:03:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:07,852 INFO L225 Difference]: With dead ends: 102 [2022-11-22 02:03:07,854 INFO L226 Difference]: Without dead ends: 57 [2022-11-22 02:03:07,855 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:03:07,857 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:07,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:03:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-22 02:03:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-22 02:03:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-11-22 02:03:07,881 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 29 [2022-11-22 02:03:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:07,882 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-11-22 02:03:07,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-22 02:03:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-11-22 02:03:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:03:07,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:07,885 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:07,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:03:07,886 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:03:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1633940887, now seen corresponding path program 1 times [2022-11-22 02:03:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:07,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010334790] [2022-11-22 02:03:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:03:07,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010334790] [2022-11-22 02:03:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010334790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:07,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:03:07,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:03:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43949979] [2022-11-22 02:03:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:07,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:03:07,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:03:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:03:07,993 INFO L87 Difference]: Start difference. First operand 57 states and 72 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 02:03:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:08,063 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-11-22 02:03:08,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:03:08,064 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 30 [2022-11-22 02:03:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:08,065 INFO L225 Difference]: With dead ends: 80 [2022-11-22 02:03:08,066 INFO L226 Difference]: Without dead ends: 79 [2022-11-22 02:03:08,066 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:03:08,068 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:08,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-22 02:03:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-11-22 02:03:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-11-22 02:03:08,081 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2022-11-22 02:03:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:08,082 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-11-22 02:03:08,082 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-22 02:03:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-11-22 02:03:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:03:08,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:08,084 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:03:08,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 887440164, now seen corresponding path program 1 times [2022-11-22 02:03:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:08,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177825232] [2022-11-22 02:03:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:08,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-22 02:03:08,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:08,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177825232] [2022-11-22 02:03:08,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177825232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:08,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:03:08,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:03:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805757013] [2022-11-22 02:03:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:08,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:03:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:08,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:03:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:03:08,356 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:03:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:08,434 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-11-22 02:03:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:03:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-11-22 02:03:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:08,440 INFO L225 Difference]: With dead ends: 56 [2022-11-22 02:03:08,440 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 02:03:08,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:03:08,445 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:08,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:03:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 02:03:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-22 02:03:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 40 states have internal predecessors, (40), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-22 02:03:08,456 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 31 [2022-11-22 02:03:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:08,457 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-22 02:03:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-22 02:03:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-22 02:03:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 02:03:08,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:08,458 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] [2022-11-22 02:03:08,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:03:08,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1075359679, now seen corresponding path program 1 times [2022-11-22 02:03:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:08,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655312412] [2022-11-22 02:03:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:03:08,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655312412] [2022-11-22 02:03:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655312412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270761061] [2022-11-22 02:03:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:08,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:08,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:08,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:03:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:08,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:03:08,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:08,772 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:03:08,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:03:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270761061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:08,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:03:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:03:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166891105] [2022-11-22 02:03:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:08,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:03:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:03:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:03:08,775 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:03:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:08,820 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-11-22 02:03:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:03:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 40 [2022-11-22 02:03:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:08,825 INFO L225 Difference]: With dead ends: 55 [2022-11-22 02:03:08,825 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 02:03:08,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:03:08,833 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:08,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 02:03:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 02:03:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 39 states have internal predecessors, (39), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-22 02:03:08,855 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 40 [2022-11-22 02:03:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:08,856 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-22 02:03:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:03:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-22 02:03:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:03:08,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:08,865 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] [2022-11-22 02:03:08,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 02:03:09,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 02:03:09,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1023588183, now seen corresponding path program 1 times [2022-11-22 02:03:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:09,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900660417] [2022-11-22 02:03:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 02:03:09,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:09,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900660417] [2022-11-22 02:03:09,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900660417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124277784] [2022-11-22 02:03:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:09,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:09,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:09,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:03:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:09,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:03:09,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:09,337 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:03:09,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:03:09,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124277784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:09,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:03:09,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:03:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391319341] [2022-11-22 02:03:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:03:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:03:09,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:03:09,340 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:03:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:09,388 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-11-22 02:03:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:03:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 41 [2022-11-22 02:03:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:09,390 INFO L225 Difference]: With dead ends: 71 [2022-11-22 02:03:09,390 INFO L226 Difference]: Without dead ends: 70 [2022-11-22 02:03:09,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:03:09,391 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:09,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-22 02:03:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-11-22 02:03:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 02:03:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-22 02:03:09,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 41 [2022-11-22 02:03:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:09,402 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-22 02:03:09,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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:03:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-22 02:03:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-22 02:03:09,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:09,404 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:09,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:09,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:09,611 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:03:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -925097529, now seen corresponding path program 1 times [2022-11-22 02:03:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:09,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817550961] [2022-11-22 02:03:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-22 02:03:09,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817550961] [2022-11-22 02:03:09,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817550961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:09,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775645150] [2022-11-22 02:03:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:09,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:09,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:09,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:03:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:09,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:03:09,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-22 02:03:09,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:03:09,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775645150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:09,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:03:09,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-22 02:03:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657430906] [2022-11-22 02:03:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:09,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:03:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:03:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:03:09,965 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:03:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:10,022 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-22 02:03:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:03:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 44 [2022-11-22 02:03:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:10,024 INFO L225 Difference]: With dead ends: 59 [2022-11-22 02:03:10,025 INFO L226 Difference]: Without dead ends: 58 [2022-11-22 02:03:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:03:10,028 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:10,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-22 02:03:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-11-22 02:03:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 38 states have internal predecessors, (38), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-22 02:03:10,052 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 44 [2022-11-22 02:03:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:10,056 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-22 02:03:10,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-22 02:03:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-22 02:03:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 02:03:10,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:10,061 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] [2022-11-22 02:03:10,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:10,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:10,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1643916134, now seen corresponding path program 1 times [2022-11-22 02:03:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:10,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299178729] [2022-11-22 02:03:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-22 02:03:10,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299178729] [2022-11-22 02:03:10,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299178729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149805952] [2022-11-22 02:03:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:10,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:10,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:10,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:10,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:03:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:10,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:03:10,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-22 02:03:10,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:03:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149805952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:10,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:03:10,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 02:03:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526964757] [2022-11-22 02:03:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:10,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:03:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:03:10,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:03:10,639 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 02:03:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:10,691 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-22 02:03:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:03:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 50 [2022-11-22 02:03:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:10,694 INFO L225 Difference]: With dead ends: 82 [2022-11-22 02:03:10,694 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 02:03:10,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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:03:10,697 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:10,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 02:03:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 02:03:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-22 02:03:10,706 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-11-22 02:03:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:10,707 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-22 02:03:10,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-22 02:03:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-22 02:03:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-22 02:03:10,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:10,709 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] [2022-11-22 02:03:10,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:10,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-22 02:03:10,915 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:03:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -605160261, now seen corresponding path program 1 times [2022-11-22 02:03:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382415647] [2022-11-22 02:03:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 02:03:11,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382415647] [2022-11-22 02:03:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382415647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201880711] [2022-11-22 02:03:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:11,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:11,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:11,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:03:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:11,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:03:11,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-22 02:03:11,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:03:11,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201880711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:11,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:03:11,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-22 02:03:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752110581] [2022-11-22 02:03:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:11,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:03:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:11,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:03:11,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:03:11,203 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 02:03:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:11,247 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-11-22 02:03:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:03:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2022-11-22 02:03:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:11,249 INFO L225 Difference]: With dead ends: 65 [2022-11-22 02:03:11,249 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 02:03:11,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 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:03:11,251 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:11,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:03:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 02:03:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 02:03:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-22 02:03:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-22 02:03:11,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 54 [2022-11-22 02:03:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:11,267 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-22 02:03:11,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-22 02:03:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-22 02:03:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-22 02:03:11,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:11,269 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] [2022-11-22 02:03:11,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:11,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:03:11,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -787085549, now seen corresponding path program 1 times [2022-11-22 02:03:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:11,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904036571] [2022-11-22 02:03:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:11,670 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:03:11,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904036571] [2022-11-22 02:03:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904036571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513231587] [2022-11-22 02:03:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:11,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:11,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:11,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:03:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:11,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:03:11,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:11,910 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:03:11,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:03:12,032 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:03:12,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513231587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:03:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1998163183] [2022-11-22 02:03:12,064 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2022-11-22 02:03:12,065 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:03:12,073 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:03:12,081 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:03:12,082 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:03:17,053 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-11-22 02:03:17,075 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 31 for LOIs [2022-11-22 02:03:17,079 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-11-22 02:03:17,102 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 35 for LOIs [2022-11-22 02:03:17,107 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:03:24,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1998163183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:03:24,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:03:24,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [4, 4, 4] total 36 [2022-11-22 02:03:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136846732] [2022-11-22 02:03:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:03:24,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 02:03:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:03:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 02:03:24,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 02:03:24,201 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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:03:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:34,134 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-11-22 02:03:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-22 02:03:34,136 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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 59 [2022-11-22 02:03:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:34,137 INFO L225 Difference]: With dead ends: 128 [2022-11-22 02:03:34,137 INFO L226 Difference]: Without dead ends: 84 [2022-11-22 02:03:34,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2022-11-22 02:03:34,139 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 125 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:34,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 339 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-22 02:03:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-22 02:03:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-11-22 02:03:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-22 02:03:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-22 02:03:34,163 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 59 [2022-11-22 02:03:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:34,163 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-22 02:03:34,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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:03:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-22 02:03:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-22 02:03:34,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:34,165 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] [2022-11-22 02:03:34,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:34,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:34,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:03:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -664144476, now seen corresponding path program 1 times [2022-11-22 02:03:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:03:34,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229512399] [2022-11-22 02:03:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:03:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:34,532 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:03:34,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:03:34,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229512399] [2022-11-22 02:03:34,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229512399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:03:34,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069782505] [2022-11-22 02:03:34,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:03:34,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:03:34,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:03:34,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:03:34,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:03:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:03:34,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:03:34,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:03:34,699 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:03:34,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:03:34,771 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:03:34,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069782505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:03:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551281415] [2022-11-22 02:03:34,775 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-22 02:03:34,775 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:03:34,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:03:34,776 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:03:34,776 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:03:38,464 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-11-22 02:03:38,483 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 66 for LOIs [2022-11-22 02:03:38,496 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-11-22 02:03:38,512 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-22 02:03:38,546 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:04:30,896 WARN L233 SmtUtils]: Spent 49.78s on a formula simplification. DAG size of input: 207 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:04:37,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [551281415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:04:37,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:04:37,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 37 [2022-11-22 02:04:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284885818] [2022-11-22 02:04:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:04:37,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:04:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:04:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:04:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2022-11-22 02:04:37,135 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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:04:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:04:46,770 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-11-22 02:04:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-22 02:04:46,771 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 61 [2022-11-22 02:04:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:04:46,772 INFO L225 Difference]: With dead ends: 108 [2022-11-22 02:04:46,772 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 02:04:46,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2022-11-22 02:04:46,774 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 103 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:04:46,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 308 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-22 02:04:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 02:04:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 02:04:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-22 02:04:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-11-22 02:04:46,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2022-11-22 02:04:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:04:46,797 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-11-22 02:04:46,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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:04:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-11-22 02:04:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-22 02:04:46,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:04:46,798 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] [2022-11-22 02:04:46,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 02:04:47,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:04:47,004 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:04:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:04:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1035912252, now seen corresponding path program 1 times [2022-11-22 02:04:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:04:47,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804998782] [2022-11-22 02:04:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:04:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:04:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:04:47,205 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:04:47,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:04:47,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804998782] [2022-11-22 02:04:47,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804998782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:04:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029405833] [2022-11-22 02:04:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:04:47,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:04:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:04:47,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:04:47,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:04:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:04:47,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:04:47,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:04:47,382 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:04:47,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:04:47,457 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:04:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029405833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:04:47,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656542660] [2022-11-22 02:04:47,460 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-22 02:04:47,460 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:04:47,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:04:47,461 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:04:47,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:04:51,107 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-11-22 02:04:51,123 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-22 02:04:51,126 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-11-22 02:04:51,142 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-22 02:04:51,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:05:10,322 WARN L233 SmtUtils]: Spent 11.73s on a formula simplification. DAG size of input: 217 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:44,904 WARN L233 SmtUtils]: Spent 28.49s on a formula simplification. DAG size of input: 299 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:46,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [656542660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:05:46,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:05:46,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 37 [2022-11-22 02:05:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443776707] [2022-11-22 02:05:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:05:46,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:05:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:05:46,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:05:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1220, Unknown=2, NotChecked=0, Total=1406 [2022-11-22 02:05:46,417 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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:05:49,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:06:07,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:06:16,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:06:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:06:16,850 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-11-22 02:06:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 02:06:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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 61 [2022-11-22 02:06:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:06:16,852 INFO L225 Difference]: With dead ends: 99 [2022-11-22 02:06:16,852 INFO L226 Difference]: Without dead ends: 55 [2022-11-22 02:06:16,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 143 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=359, Invalid=2188, Unknown=3, NotChecked=0, Total=2550 [2022-11-22 02:06:16,854 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:06:16,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 235 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 881 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2022-11-22 02:06:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-22 02:06:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-22 02:06:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-22 02:06:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-22 02:06:16,879 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 61 [2022-11-22 02:06:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:06:16,880 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-22 02:06:16,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 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:06:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-22 02:06:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-22 02:06:16,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:06:16,881 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] [2022-11-22 02:06:16,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:06:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:06:17,088 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-22 02:06:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:06:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 731562517, now seen corresponding path program 1 times [2022-11-22 02:06:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:06:17,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639098197] [2022-11-22 02:06:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:06:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:06:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:06:17,265 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:06:17,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:06:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639098197] [2022-11-22 02:06:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639098197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:06:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963261917] [2022-11-22 02:06:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:06:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:06:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:06:17,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:06:17,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:06:17,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 02:06:17,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:06:17,460 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:06:17,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:06:17,543 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:06:17,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963261917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:06:17,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545851592] [2022-11-22 02:06:17,549 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-22 02:06:17,549 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:06:17,550 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:06:17,550 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:06:17,550 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:06:21,233 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 99 for LOIs [2022-11-22 02:06:21,249 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-22 02:06:21,252 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 99 for LOIs [2022-11-22 02:06:21,262 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 77 for LOIs [2022-11-22 02:06:21,269 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:06:36,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1545851592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:06:36,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:06:36,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 38 [2022-11-22 02:06:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540561114] [2022-11-22 02:06:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:06:36,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:06:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:06:36,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:06:36,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2022-11-22 02:06:36,022 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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:06:42,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:06:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:06:47,884 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-22 02:06:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-22 02:06:47,885 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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 63 [2022-11-22 02:06:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:06:47,885 INFO L225 Difference]: With dead ends: 73 [2022-11-22 02:06:47,885 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:06:47,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=397, Invalid=2153, Unknown=0, NotChecked=0, Total=2550 [2022-11-22 02:06:47,887 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:06:47,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-22 02:06:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:06:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:06:47,888 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:06:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:06:47,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-11-22 02:06:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:06:47,888 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:06:47,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 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:06:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:06:47,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:06:47,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-22 02:06:47,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-22 02:06:47,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-22 02:06:47,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-22 02:06:47,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-22 02:06:47,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-22 02:06:47,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-22 02:06:47,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-22 02:06:47,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:06:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 02:06:48,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:06:58,079 WARN L233 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 467 DAG size of output: 346 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:09,285 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 470 DAG size of output: 354 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:22,056 WARN L233 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 418 DAG size of output: 193 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:29,973 WARN L233 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 464 DAG size of output: 348 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:45,549 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 460 DAG size of output: 312 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:58,065 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 470 DAG size of output: 354 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 02:07:58,071 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-22 02:07:58,071 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-22 02:07:58,071 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-11-22 02:07:58,071 INFO L902 garLoopResultBuilder]: At program point staticReturnsFalseENTRY(lines 1552 1555) the Hoare annotation is: true [2022-11-22 02:07:58,071 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-22 02:07:58,072 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-22 02:07:58,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-22 02:07:58,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-11-22 02:07:58,072 INFO L899 garLoopResultBuilder]: For program point L1572(line 1572) no Hoare annotation was computed. [2022-11-22 02:07:58,072 INFO L899 garLoopResultBuilder]: For program point L1572-1(line 1572) no Hoare annotation was computed. [2022-11-22 02:07:58,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1572) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1630(line 1630) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1630-1(lines 1630 1636) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1564-1(lines 1564 1579) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1637) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1589-1(lines 1589 1600) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1601) no Hoare annotation was computed. [2022-11-22 02:07:58,073 INFO L899 garLoopResultBuilder]: For program point L1614-1(lines 1614 1620) no Hoare annotation was computed. [2022-11-22 02:07:58,075 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse67 (mod (let ((.cse69 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_152))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse41 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse10 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse26 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse28 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse33 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse17 (= (select |#length| 3) 54)) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= (select |#valid| 4) 1)) (.cse20 (= (select |#valid| 1) 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse22 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse27 (= (select |#length| 1) 1)) (.cse29 (= (select |#valid| 2) 1)) (.cse30 (= |#NULL.offset| 0)) (.cse31 (= ~globalFalse~0 0)) (.cse48 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse32 (= ~globalArgc~0 0)) (.cse34 (= (select |#valid| 6) 1)) (.cse35 (= 5 ~globalFive~0)) (.cse36 (= (select |#length| 4) 54)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse41 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse42 (mod (let ((.cse44 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse46 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse43 (= .cse46 0)) (.cse45 (= .cse44 0)) (.cse47 (= .cse44 .cse46))) (ite (= (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse42 2147483647) .cse42 (+ .cse42 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse26 .cse27 .cse29 .cse30 .cse31 .cse48 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse49 (mod (+ (* 4294967295 (let ((.cse51 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse53 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse50 (= .cse53 0)) (.cse52 (= .cse51 0)) (.cse54 (= .cse51 .cse53))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_146))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse49 2147483647) .cse49 (+ .cse49 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse41 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse55 (mod (let ((.cse57 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse57 .cse59))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ .cse55 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse29 .cse30 .cse31 .cse48 .cse32 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40))) [2022-11-22 02:07:58,076 INFO L895 garLoopResultBuilder]: At program point L1573(line 1573) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:07:58,077 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2022-11-22 02:07:58,077 INFO L899 garLoopResultBuilder]: For program point L1606-2(lines 1606 1613) no Hoare annotation was computed. [2022-11-22 02:07:58,079 INFO L895 garLoopResultBuilder]: At program point L1606-3(lines 1606 1613) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse65 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse7 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse8 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse9 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse18 (= (select |#valid| 3) 1)) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= 21 (select |#length| 5))) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= (select |#length| 3) 54)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse58 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#length| 4) 54)) (.cse72 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse73 (mod (let ((.cse75 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse77 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse74 (= .cse77 0)) (.cse76 (= .cse75 0)) (.cse78 (= .cse75 .cse77))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_152))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse73 2147483647) .cse73 (+ .cse73 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse44 (mod (let ((.cse46 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse48 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse45 (= .cse48 0)) (.cse47 (= .cse46 0)) (.cse49 (= .cse48 .cse46))) (ite (= (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse44 2147483647) .cse44 (+ .cse44 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse50 .cse51) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse52 (mod (let ((.cse54 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse56 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse53 (= .cse56 0)) (.cse55 (= .cse54 0)) (.cse57 (= .cse54 .cse56))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse52 2147483647) .cse52 (+ .cse52 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse58 .cse29 .cse30 .cse31 .cse33 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse59 (mod (let ((.cse61 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse63 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse60 (= .cse63 0)) (.cse62 (= .cse61 0)) (.cse64 (= .cse63 .cse61))) (ite (= (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse60 .cse61 (ite .cse62 .cse63 (ite .cse64 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse59 2147483647) .cse59 (+ .cse59 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse35 .cse36 .cse37 .cse65 .cse38 .cse40 .cse41 .cse42 .cse43 .cse50 .cse51) (and .cse0 .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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse66 (mod (let ((.cse68 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse70 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse67 (= .cse70 0)) (.cse69 (= .cse68 0)) (.cse71 (= .cse68 .cse70))) (ite (= (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse66 2147483647) .cse66 (+ .cse66 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse32 .cse33 .cse35 .cse36 .cse37 .cse65 .cse38 .cse39 .cse40 .cse41 .cse42 .cse72 .cse43 .cse50 .cse51) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse25 .cse26 .cse27 .cse28 .cse58 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse72 .cse43 .cse50 .cse51))) [2022-11-22 02:07:58,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1572) no Hoare annotation was computed. [2022-11-22 02:07:58,080 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse7 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (= 1 (select |#valid| 5))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse11 (= (select |#length| 6) 18)) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse13 (= ~globalArgv~0.offset 0)) (.cse14 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= 21 (select |#length| 5))) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse27 (= (select |#length| 3) 54)) (.cse28 (= 16 (select |#length| 7))) (.cse29 (= (select |#valid| 4) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#length| 4) 54)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse21 (mod (let ((.cse23 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse25 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse22 (= .cse25 0)) (.cse24 (= .cse23 0)) (.cse26 (= .cse23 .cse25))) (ite (= (ite .cse22 .cse23 (ite .cse24 .cse25 (ite .cse26 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse22 .cse23 (ite .cse24 .cse25 (ite .cse26 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse22 .cse23 (ite .cse24 .cse25 (ite .cse26 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse21 2147483647) .cse21 (+ .cse21 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse47 (mod (let ((.cse49 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse49 .cse51))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse53 (mod (let ((.cse55 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse57 .cse55))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ .cse53 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse37 .cse38 .cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-22 02:07:58,081 INFO L895 garLoopResultBuilder]: At program point L1648(line 1648) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:07:58,081 INFO L899 garLoopResultBuilder]: For program point L1648-1(line 1648) no Hoare annotation was computed. [2022-11-22 02:07:58,081 INFO L895 garLoopResultBuilder]: At program point L1566(line 1566) the Hoare annotation is: false [2022-11-22 02:07:58,081 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1599) no Hoare annotation was computed. [2022-11-22 02:07:58,081 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-22 02:07:58,082 INFO L899 garLoopResultBuilder]: For program point L1633(line 1633) no Hoare annotation was computed. [2022-11-22 02:07:58,082 INFO L899 garLoopResultBuilder]: For program point L1633-1(line 1633) no Hoare annotation was computed. [2022-11-22 02:07:58,082 INFO L902 garLoopResultBuilder]: At program point L1650(line 1650) the Hoare annotation is: true [2022-11-22 02:07:58,082 INFO L899 garLoopResultBuilder]: For program point L1617(line 1617) no Hoare annotation was computed. [2022-11-22 02:07:58,082 INFO L902 garLoopResultBuilder]: At program point L1650-1(line 1650) the Hoare annotation is: true [2022-11-22 02:07:58,082 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2022-11-22 02:07:58,083 INFO L902 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: true [2022-11-22 02:07:58,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-22 02:07:58,084 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: (let ((.cse27 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse48 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 1 (select |#valid| 5))) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select |#length| 6) 18)) (.cse6 (= (select (select |#memory_int| 1) 0) 0)) (.cse7 (= ~globalArgv~0.offset 0)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= (select |#valid| 7) 1)) (.cse11 (= 21 (select |#length| 5))) (.cse12 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse15 (= (select |#length| 3) 54)) (.cse16 (= 16 (select |#length| 7))) (.cse17 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse18 (= (select |#valid| 4) 1)) (.cse19 (= (select |#valid| 1) 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse21 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse22 (= ~globalArgv~0.base 0)) (.cse23 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse24 (= (select |#valid| 0) 0)) (.cse25 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse26 (= (select |#length| 1) 1)) (.cse28 (= (select |#valid| 2) 1)) (.cse29 (= |#NULL.offset| 0)) (.cse30 (= ~globalFalse~0 0)) (.cse61 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse31 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse32 (= ~globalArgc~0 0)) (.cse33 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse34 (= (select |#valid| 6) 1)) (.cse35 (= 5 ~globalFive~0)) (.cse36 (= (select |#length| 4) 54)) (.cse37 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse38 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse39 (< 0 |#StackHeapBarrier|)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse42 (mod (+ (* 4294967295 (let ((.cse44 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse46 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse43 (= .cse46 0)) (.cse45 (= .cse44 0)) (.cse47 (= .cse44 .cse46))) (ite (= (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_146))) (ite (= (ite .cse43 .cse44 (ite .cse45 .cse46 (ite .cse47 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse42 2147483647) .cse42 (+ .cse42 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse48 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse49 (mod (let ((.cse51 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse53 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse50 (= .cse53 0)) (.cse52 (= .cse51 0)) (.cse54 (= .cse53 .cse51))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse49 2147483647) .cse49 (+ .cse49 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse48 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse55 (mod (let ((.cse57 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse57 .cse59))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ .cse55 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse25 .cse26 .cse28 .cse29 .cse30 .cse61 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse62 (mod (let ((.cse64 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse66 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse63 (= .cse66 0)) (.cse65 (= .cse64 0)) (.cse67 (= .cse64 .cse66))) (ite (= (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_152))) (ite (= (ite .cse63 .cse64 (ite .cse65 .cse66 (ite .cse67 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse62 2147483647) .cse62 (+ .cse62 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse68 (mod (let ((.cse70 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse72 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse69 (= .cse72 0)) (.cse71 (= .cse70 0)) (.cse73 (= .cse70 .cse72))) (ite (= (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse68 2147483647) .cse68 (+ .cse68 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse74 (mod (let ((.cse76 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse78 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse75 (= .cse78 0)) (.cse77 (= .cse76 0)) (.cse79 (= .cse78 .cse76))) (ite (= (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse74 2147483647) .cse74 (+ .cse74 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse28 .cse29 .cse30 .cse61 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41))) [2022-11-22 02:07:58,085 INFO L899 garLoopResultBuilder]: For program point L1593(line 1593) no Hoare annotation was computed. [2022-11-22 02:07:58,085 INFO L899 garLoopResultBuilder]: For program point L1626-1(line 1626) no Hoare annotation was computed. [2022-11-22 02:07:58,085 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:07:58,085 INFO L899 garLoopResultBuilder]: For program point L1593-1(line 1593) no Hoare annotation was computed. [2022-11-22 02:07:58,086 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-11-22 02:07:58,087 INFO L895 garLoopResultBuilder]: At program point L1626-4(lines 1626 1629) the Hoare annotation is: (let ((.cse60 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse0 (= 21 (select |#length| 2))) (.cse7 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (= 1 (select |#valid| 5))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse11 (= (select |#length| 6) 18)) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse13 (= ~globalArgv~0.offset 0)) (.cse14 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= 21 (select |#length| 5))) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (select |#length| 3) 54)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#valid| 0) 0)) (.cse30 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse31 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse67 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse37 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#length| 4) 54)) (.cse43 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse44 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse52 (= |#NULL.base| 0)) (.cse53 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse50 .cse48))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse52 .cse53) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse54 (mod (let ((.cse56 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse58 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse55 (= .cse58 0)) (.cse57 (= .cse56 0)) (.cse59 (= .cse56 .cse58))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse54 2147483647) .cse54 (+ .cse54 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse60 .cse27 .cse28 .cse29 .cse30 .cse31 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse33 .cse34 .cse35 .cse67 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse52 .cse53) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse23 .cse24 .cse25 .cse26 .cse60 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse52 .cse53) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse68 (mod (let ((.cse70 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse72 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse69 (= .cse72 0)) (.cse71 (= .cse70 0)) (.cse73 (= .cse70 .cse72))) (ite (= (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse68 2147483647) .cse68 (+ .cse68 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse30 .cse31 .cse33 .cse34 .cse35 .cse67 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse74 (mod (let ((.cse76 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse78 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse75 (= .cse78 0)) (.cse77 (= .cse76 0)) (.cse79 (= .cse76 .cse78))) (ite (= (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_152))) (ite (= (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse74 2147483647) .cse74 (+ .cse74 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse43 .cse44 .cse45 .cse52 .cse53))) [2022-11-22 02:07:58,088 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1563) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:07:58,089 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse67 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse18 (= (select |#valid| 3) 1)) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= 21 (select |#length| 5))) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= (select |#length| 3) 54)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse60 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#length| 4) 54)) (.cse44 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse52 (= |#NULL.base| 0)) (.cse53 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_151 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19| Int) (v_~bitwiseXor_149 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse4 (mod (let ((.cse6 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19|)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_152))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_19| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_19|))) .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 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse50 .cse48))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse54 (mod (let ((.cse56 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse58 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse55 (= .cse58 0)) (.cse57 (= .cse56 0)) (.cse59 (= .cse56 .cse58))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse54 2147483647) .cse54 (+ .cse54 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse60 .cse29 .cse30 .cse31 .cse33 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse65 .cse63))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse35 .cse36 .cse37 .cse67 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (= (let ((.cse68 (mod (let ((.cse70 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse72 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse69 (= .cse72 0)) (.cse71 (= .cse70 0)) (.cse73 (= .cse70 .cse72))) (ite (= (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse69 .cse70 (ite .cse71 .cse72 (ite .cse73 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse68 2147483647) .cse68 (+ .cse68 (- 4294967296)))) |ULTIMATE.start_goodB2G2_~data~1#1|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse32 .cse33 .cse35 .cse36 .cse37 .cse67 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse74 (mod (let ((.cse76 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse78 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse75 (= .cse78 0)) (.cse77 (= .cse76 0)) (.cse79 (= .cse76 .cse78))) (ite (= (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_152))) (ite (= (ite .cse75 .cse76 (ite .cse77 .cse78 (ite .cse79 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse74 2147483647) .cse74 (+ .cse74 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse44 .cse45 .cse52 .cse53) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse25 .cse26 .cse27 .cse28 .cse60 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse52 .cse53))) [2022-11-22 02:07:58,090 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse7 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (= 1 (select |#valid| 5))) (.cse9 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select |#length| 6) 18)) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= 21 (select |#length| 5))) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= (select |#length| 3) 54)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#valid| 0) 0)) (.cse30 (= (select |#length| 1) 1)) (.cse31 (= (select |#valid| 2) 1)) (.cse32 (= |#NULL.offset| 0)) (.cse33 (= ~globalFalse~0 0)) (.cse34 (= ~globalArgc~0 0)) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse37 (= (select |#length| 4) 54)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .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 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse34 .cse35 .cse36 .cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse41 (mod (let ((.cse43 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse43 .cse45))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_152))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse38 .cse39 .cse40))) [2022-11-22 02:07:58,091 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-11-22 02:07:58,092 INFO L895 garLoopResultBuilder]: At program point L1585-4(lines 1585 1588) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse7 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (= 1 (select |#valid| 5))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse11 (= (select |#length| 6) 18)) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse13 (= ~globalArgv~0.offset 0)) (.cse14 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= 21 (select |#length| 5))) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= (select |#length| 3) 54)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse26 (= ~globalArgv~0.base 0)) (.cse27 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse28 (= (select |#valid| 0) 0)) (.cse29 (= (select |#length| 1) 1)) (.cse30 (= (select |#valid| 2) 1)) (.cse31 (= |#NULL.offset| 0)) (.cse32 (= ~globalFalse~0 0)) (.cse33 (= ~globalArgc~0 0)) (.cse34 (= (select |#valid| 6) 1)) (.cse35 (= 5 ~globalFive~0)) (.cse36 (= (select |#length| 4) 54)) (.cse37 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse38 (mod (let ((.cse40 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse42 .cse40))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ .cse38 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse44 .cse45) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (exists ((v_~bitwiseXor_184 Int) (v_~bitwiseXor_183 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse50 .cse48))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_183))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181)))) 0 v_~bitwiseXor_184))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse30 .cse31 .cse32 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse33 .cse34 .cse35 .cse36 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse52 (mod (let ((.cse54 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse56 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse53 (= .cse56 0)) (.cse55 (= .cse54 0)) (.cse57 (= .cse54 .cse56))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_152))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse52 2147483647) .cse52 (+ .cse52 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse37 .cse44 .cse45))) [2022-11-22 02:07:58,093 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#length| 3) 54) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#length| 4) 54) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (= (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-22 02:07:58,093 INFO L899 garLoopResultBuilder]: For program point L1577-1(lines 1564 1579) no Hoare annotation was computed. [2022-11-22 02:07:58,093 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1621) no Hoare annotation was computed. [2022-11-22 02:07:58,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:07:58,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1617) no Hoare annotation was computed. [2022-11-22 02:07:58,094 INFO L895 garLoopResultBuilder]: At program point L1594(line 1594) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse7 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse8 (= 1 (select |#valid| 5))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse10 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse11 (= (select |#length| 6) 18)) (.cse12 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_150 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse44 (mod (let ((.cse46 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse48 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse45 (= .cse48 0)) (.cse47 (= .cse46 0)) (.cse49 (= .cse46 .cse48))) (ite (= (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_151))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_152))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse45 .cse46 (ite .cse47 .cse48 (ite .cse49 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_150))))) 4294967296))) (ite (<= .cse44 2147483647) .cse44 (+ .cse44 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647)))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= 21 (select |#length| 5))) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646)) (.cse24 (= (select |#length| 3) 54)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.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 |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (= ~globalArgc~0 0)) (.cse37 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= 5 ~globalFive~0)) (.cse40 (= (select |#length| 4) 54)) (.cse41 (< 0 |#StackHeapBarrier|)) (.cse42 (= |#NULL.base| 0)) (.cse43 (= ~globalTrue~0 1))) (or (and .cse0 (exists ((|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| Int) (v_~bitwiseXor_148 Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| Int) (v_~bitwiseXor_146 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| Int) (v_~bitwiseXor_145 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 2147483647) (= (let ((.cse1 (mod (+ (* 4294967295 (let ((.cse3 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|)) (.cse5 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18|))) (let ((.cse2 (= .cse5 0)) (.cse4 (= .cse3 0)) (.cse6 (= .cse3 .cse5))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_145))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18| 0) (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_146))) (ite (= (ite .cse2 .cse3 (ite .cse4 .cse5 (ite .cse6 0 v_~bitwiseXor_148))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) 0 v_~bitwiseXor_147)))))) 4294967295) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_18|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_18| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_18| 2147483647))) .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| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (and .cse0 .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 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43))) [2022-11-22 02:07:58,094 INFO L899 garLoopResultBuilder]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2022-11-22 02:07:58,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1593) no Hoare annotation was computed. [2022-11-22 02:07:58,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1633) no Hoare annotation was computed. [2022-11-22 02:07:58,095 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-11-22 02:07:58,095 INFO L902 garLoopResultBuilder]: At program point staticReturnsTrueENTRY(lines 1548 1551) the Hoare annotation is: true [2022-11-22 02:07:58,099 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:07:58,102 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:07:58,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:07:58 BoogieIcfgContainer [2022-11-22 02:07:58,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:07:58,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:07:58,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:07:58,112 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:07:58,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:06" (3/4) ... [2022-11-22 02:07:58,116 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:07:58,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-22 02:07:58,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-11-22 02:07:58,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-22 02:07:58,123 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-11-22 02:07:58,128 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-22 02:07:58,129 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-22 02:07:58,129 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-22 02:07:58,129 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 02:07:58,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:07:58,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:07:58,177 INFO L158 Benchmark]: Toolchain (without parser) took 294463.44ms. Allocated memory was 182.5MB in the beginning and 488.6MB in the end (delta: 306.2MB). Free memory was 137.0MB in the beginning and 301.2MB in the end (delta: -164.1MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,177 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 182.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:07:58,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1480.60ms. Allocated memory is still 182.5MB. Free memory was 137.0MB in the beginning and 143.9MB in the end (delta: -6.8MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.29ms. Allocated memory was 182.5MB in the beginning and 232.8MB in the end (delta: 50.3MB). Free memory was 143.9MB in the beginning and 197.5MB in the end (delta: -53.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,178 INFO L158 Benchmark]: Boogie Preprocessor took 66.03ms. Allocated memory is still 232.8MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,179 INFO L158 Benchmark]: RCFGBuilder took 832.83ms. Allocated memory is still 232.8MB. Free memory was 195.4MB in the beginning and 163.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,179 INFO L158 Benchmark]: TraceAbstraction took 291903.86ms. Allocated memory was 232.8MB in the beginning and 488.6MB in the end (delta: 255.9MB). Free memory was 162.9MB in the beginning and 305.4MB in the end (delta: -142.5MB). Peak memory consumption was 258.7MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,180 INFO L158 Benchmark]: Witness Printer took 64.66ms. Allocated memory is still 488.6MB. Free memory was 305.4MB in the beginning and 301.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:07:58,181 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.29ms. Allocated memory is still 182.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1480.60ms. Allocated memory is still 182.5MB. Free memory was 137.0MB in the beginning and 143.9MB in the end (delta: -6.8MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.29ms. Allocated memory was 182.5MB in the beginning and 232.8MB in the end (delta: 50.3MB). Free memory was 143.9MB in the beginning and 197.5MB in the end (delta: -53.6MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.03ms. Allocated memory is still 232.8MB. Free memory was 197.5MB in the beginning and 195.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.83ms. Allocated memory is still 232.8MB. Free memory was 195.4MB in the beginning and 163.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 291903.86ms. Allocated memory was 232.8MB in the beginning and 488.6MB in the end (delta: 255.9MB). Free memory was 162.9MB in the beginning and 305.4MB in the end (delta: -142.5MB). Peak memory consumption was 258.7MB. Max. memory is 16.1GB. * Witness Printer took 64.66ms. Allocated memory is still 488.6MB. Free memory was 305.4MB in the beginning and 301.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: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1633]: 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, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 291.8s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 70.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 701 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 2376 SdHoareTripleChecker+Invalid, 19.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1578 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4215 IncrementalHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 798 mSDtfsCounter, 4215 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 805 SyntacticMatches, 25 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2692 ImplicationChecksByTransitivity, 177.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 95 PreInvPairs, 126 NumberOfFragments, 20487 HoareAnnotationTreeSize, 95 FomulaSimplifications, 1156 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 23 FomulaSimplificationsInter, 40335 FormulaSimplificationTreeSizeReductionInter, 69.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1578 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1757 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 696/716 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: 16.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 212, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 132, TOOLS_POST_TIME: 4.2s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 6.2s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 3.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 372, TOOLS_QUANTIFIERELIM_TIME: 13.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 512, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 1.6s, 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: 212, DOMAIN_ISBOTTOM_TIME: 0.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: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 6008, DAG_COMPRESSION_RETAINED_NODES: 524, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1650]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-22 02:07:58,398 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-22 02:07:58,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fb73eff-ef28-4441-9ec0-556691710a12/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE