./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS --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 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e --- 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-8393723 [2022-11-19 06:57:32,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:57:32,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:57:32,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:57:32,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:57:32,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:57:32,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:57:32,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:57:32,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:57:32,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:57:32,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:57:32,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:57:32,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:57:32,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:57:32,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:57:32,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:57:32,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:57:32,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:57:32,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:57:32,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:57:32,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:57:32,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:57:32,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:57:32,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:57:32,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:57:32,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:57:32,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:57:32,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:57:32,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:57:32,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:57:32,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:57:32,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:57:32,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:57:32,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:57:32,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:57:32,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:57:32,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:57:32,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:57:32,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:57:32,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:57:32,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:57:32,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 06:57:32,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:57:32,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:57:32,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:57:32,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:57:32,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:57:32,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:57:32,678 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:57:32,678 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:57:32,679 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:57:32,679 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:57:32,680 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:57:32,681 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:57:32,681 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:57:32,681 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:57:32,682 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:57:32,682 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:57:32,682 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:57:32,682 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:57:32,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:57:32,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:57:32,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:57:32,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:57:32,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:57:32,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:57:32,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:57:32,687 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 06:57:32,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:57:32,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:57:32,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:57:32,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:57:32,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:57:32,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:57:32,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:57:32,690 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:57:32,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:57:32,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:57:32,691 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:57:32,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:57:32,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:57:32,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:57:32,692 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_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/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_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS 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 -> 5b8525e411339426e47b0c6cded986bded6156754572b2487a7c059c496e530e [2022-11-19 06:57:33,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:57:33,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:57:33,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:57:33,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:57:33,085 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:57:33,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-19 06:57:33,171 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/data/bd41366b8/e20e94238477497a9275eda1f448b5ec/FLAGbc18d615d [2022-11-19 06:57:33,973 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:57:33,974 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-19 06:57:34,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/data/bd41366b8/e20e94238477497a9275eda1f448b5ec/FLAGbc18d615d [2022-11-19 06:57:34,166 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/data/bd41366b8/e20e94238477497a9275eda1f448b5ec [2022-11-19 06:57:34,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:57:34,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:57:34,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:57:34,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:57:34,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:57:34,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:34" (1/1) ... [2022-11-19 06:57:34,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdb72d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:34, skipping insertion in model container [2022-11-19 06:57:34,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:57:34" (1/1) ... [2022-11-19 06:57:34,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:57:34,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:57:34,841 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:57:35,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:57:35,481 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:57:35,504 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:57:35,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:57:35,745 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:57:35,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35 WrapperNode [2022-11-19 06:57:35,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:57:35,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:57:35,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:57:35,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:57:35,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,823 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2022-11-19 06:57:35,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:57:35,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:57:35,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:57:35,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:57:35,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:57:35,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:57:35,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:57:35,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:57:35,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (1/1) ... [2022-11-19 06:57:35,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:57:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:35,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:57:35,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 06:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 06:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 06:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 06:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 06:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 06:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:57:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-11-19 06:57:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-11-19 06:57:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:57:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-11-19 06:57:36,012 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-11-19 06:57:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 06:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:57:36,251 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:57:36,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:57:36,674 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:57:36,741 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:57:36,741 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:57:36,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:36 BoogieIcfgContainer [2022-11-19 06:57:36,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:57:36,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:57:36,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:57:36,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:57:36,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:57:34" (1/3) ... [2022-11-19 06:57:36,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:36, skipping insertion in model container [2022-11-19 06:57:36,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:57:35" (2/3) ... [2022-11-19 06:57:36,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3ca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:57:36, skipping insertion in model container [2022-11-19 06:57:36,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:36" (3/3) ... [2022-11-19 06:57:36,756 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_08_good.i [2022-11-19 06:57:36,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:57:36,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 06:57:36,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:57:36,882 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;@51dc800c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:57:36,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 06:57:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:57:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:57:36,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:36,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:36,900 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-19 06:57:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash 529550636, now seen corresponding path program 1 times [2022-11-19 06:57:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:36,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113008120] [2022-11-19 06:57:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:37,458 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-19 06:57:37,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113008120] [2022-11-19 06:57:37,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113008120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:37,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:37,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:57:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137190959] [2022-11-19 06:57:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:37,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:37,530 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:57:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:37,717 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-19 06:57:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-19 06:57:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:37,732 INFO L225 Difference]: With dead ends: 137 [2022-11-19 06:57:37,733 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 06:57:37,737 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-19 06:57:37,742 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:37,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:57:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 06:57:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 06:57:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:57:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-19 06:57:37,809 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-19 06:57:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:37,811 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-19 06:57:37,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:57:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-19 06:57:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:57:37,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:37,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:37,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:57:37,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1357069969, now seen corresponding path program 1 times [2022-11-19 06:57:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:37,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478798115] [2022-11-19 06:57:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:37,955 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-19 06:57:37,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:37,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478798115] [2022-11-19 06:57:37,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478798115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:37,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:37,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:57:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525822435] [2022-11-19 06:57:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:37,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:57:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:57:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:57:37,961 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:57:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:37,996 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-11-19 06:57:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:57:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2022-11-19 06:57:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:37,999 INFO L225 Difference]: With dead ends: 68 [2022-11-19 06:57:37,999 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 06:57:38,000 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-19 06:57:38,002 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:38,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 06:57:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-19 06:57:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:57:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-11-19 06:57:38,016 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-11-19 06:57:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:38,017 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-11-19 06:57:38,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:57:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-11-19 06:57:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:57:38,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:38,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:38,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:57:38,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -880503844, now seen corresponding path program 1 times [2022-11-19 06:57:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658038455] [2022-11-19 06:57:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:38,141 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-19 06:57:38,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658038455] [2022-11-19 06:57:38,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658038455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:38,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:38,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:57:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274409363] [2022-11-19 06:57:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:38,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:38,146 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:57:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:38,203 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-11-19 06:57:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-11-19 06:57:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:38,206 INFO L225 Difference]: With dead ends: 67 [2022-11-19 06:57:38,207 INFO L226 Difference]: Without dead ends: 66 [2022-11-19 06:57:38,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:57:38,209 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:38,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 174 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-19 06:57:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-19 06:57:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.368421052631579) internal successors, (52), 51 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:57:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-19 06:57:38,225 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 20 [2022-11-19 06:57:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:38,226 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-19 06:57:38,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:57:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-19 06:57:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 06:57:38,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:38,228 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:38,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:57:38,229 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-19 06:57:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 337295568, now seen corresponding path program 1 times [2022-11-19 06:57:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:38,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833063570] [2022-11-19 06:57:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:38,395 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-19 06:57:38,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:38,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833063570] [2022-11-19 06:57:38,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833063570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:38,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:38,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:57:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951121910] [2022-11-19 06:57:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:38,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:38,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:38,403 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:38,485 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2022-11-19 06:57:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-11-19 06:57:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:38,488 INFO L225 Difference]: With dead ends: 114 [2022-11-19 06:57:38,488 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:57:38,489 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-19 06:57:38,490 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:38,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:57:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:57:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 50 states have internal predecessors, (51), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:57:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-11-19 06:57:38,504 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 33 [2022-11-19 06:57:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:38,505 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-11-19 06:57:38,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-11-19 06:57:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 06:57:38,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:38,507 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:38,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:57:38,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -871225187, now seen corresponding path program 1 times [2022-11-19 06:57:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:38,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496103014] [2022-11-19 06:57:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:57:38,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:38,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496103014] [2022-11-19 06:57:38,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496103014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608619000] [2022-11-19 06:57:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:38,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:57:38,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:57:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:38,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:57:38,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-19 06:57:38,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:57:38,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608619000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:38,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:57:38,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:57:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322649490] [2022-11-19 06:57:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:38,962 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:39,015 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2022-11-19 06:57:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-11-19 06:57:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:39,018 INFO L225 Difference]: With dead ends: 106 [2022-11-19 06:57:39,018 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 06:57:39,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:39,020 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:39,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 06:57:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 06:57:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:57:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-11-19 06:57:39,033 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 34 [2022-11-19 06:57:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:39,034 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-11-19 06:57:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-11-19 06:57:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 06:57:39,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:39,036 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:39,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:39,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -292091166, now seen corresponding path program 1 times [2022-11-19 06:57:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:39,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716368719] [2022-11-19 06:57:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:39,425 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-19 06:57:39,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:39,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716368719] [2022-11-19 06:57:39,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716368719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:39,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:39,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:57:39,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855351379] [2022-11-19 06:57:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:39,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:57:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:57:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:57:39,429 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:57:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:39,459 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-11-19 06:57:39,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:57:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 36 [2022-11-19 06:57:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:39,462 INFO L225 Difference]: With dead ends: 65 [2022-11-19 06:57:39,462 INFO L226 Difference]: Without dead ends: 64 [2022-11-19 06:57:39,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:57:39,464 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:39,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-19 06:57:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-19 06:57:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:57:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-11-19 06:57:39,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 36 [2022-11-19 06:57:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:39,476 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-11-19 06:57:39,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:57:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-11-19 06:57:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:57:39,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:39,478 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:39,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:57:39,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -464891443, now seen corresponding path program 1 times [2022-11-19 06:57:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:39,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992625006] [2022-11-19 06:57:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:39,672 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-19 06:57:39,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992625006] [2022-11-19 06:57:39,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992625006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:39,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:39,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:57:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449999333] [2022-11-19 06:57:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:39,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:39,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:39,679 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:39,736 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-11-19 06:57:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:39,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-11-19 06:57:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:39,740 INFO L225 Difference]: With dead ends: 64 [2022-11-19 06:57:39,740 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:57:39,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:57:39,745 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:39,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 178 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:57:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:57:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 48 states have internal predecessors, (48), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:57:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-11-19 06:57:39,758 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2022-11-19 06:57:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:39,759 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-11-19 06:57:39,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:57:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-11-19 06:57:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 06:57:39,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:39,768 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:39,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:57:39,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 834591959, now seen corresponding path program 1 times [2022-11-19 06:57:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:39,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651815885] [2022-11-19 06:57:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:39,996 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-19 06:57:39,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651815885] [2022-11-19 06:57:40,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651815885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:40,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413952057] [2022-11-19 06:57:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:40,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:57:40,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:57:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:40,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:57:40,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:57:40,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:57:40,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413952057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:40,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:57:40,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:57:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115589346] [2022-11-19 06:57:40,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:40,204 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:57:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:40,256 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-11-19 06:57:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-11-19 06:57:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:40,265 INFO L225 Difference]: With dead ends: 94 [2022-11-19 06:57:40,265 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:57:40,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:40,270 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:40,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:57:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:57:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.236842105263158) internal successors, (47), 47 states have internal predecessors, (47), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-19 06:57:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-19 06:57:40,300 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 46 [2022-11-19 06:57:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:40,300 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-19 06:57:40,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:57:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2022-11-19 06:57:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-19 06:57:40,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:40,303 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:40,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:40,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:40,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1367423486, now seen corresponding path program 1 times [2022-11-19 06:57:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574342441] [2022-11-19 06:57:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:40,654 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-19 06:57:40,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:40,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574342441] [2022-11-19 06:57:40,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574342441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:40,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:40,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:57:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039250] [2022-11-19 06:57:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:40,660 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:57:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:40,729 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2022-11-19 06:57:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 50 [2022-11-19 06:57:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:40,732 INFO L225 Difference]: With dead ends: 80 [2022-11-19 06:57:40,732 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 06:57:40,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:57:40,738 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:40,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 06:57:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-11-19 06:57:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 50 states have internal predecessors, (52), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-19 06:57:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-11-19 06:57:40,762 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 50 [2022-11-19 06:57:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:40,762 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-11-19 06:57:40,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-19 06:57:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-11-19 06:57:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 06:57:40,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:40,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:40,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:57:40,770 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:57:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 441083458, now seen corresponding path program 1 times [2022-11-19 06:57:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:40,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030374687] [2022-11-19 06:57:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-19 06:57:40,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:40,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030374687] [2022-11-19 06:57:40,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030374687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:40,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:57:40,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:57:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47504006] [2022-11-19 06:57:40,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:40,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:57:40,943 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:57:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:40,980 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-11-19 06:57:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:40,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 53 [2022-11-19 06:57:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:40,982 INFO L225 Difference]: With dead ends: 85 [2022-11-19 06:57:40,982 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 06:57:40,983 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-19 06:57:40,984 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:40,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 06:57:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-19 06:57:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 06:57:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-11-19 06:57:40,993 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 53 [2022-11-19 06:57:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:40,993 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-11-19 06:57:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:57:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-11-19 06:57:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 06:57:40,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:40,995 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:57:40,996 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-19 06:57:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1035400911, now seen corresponding path program 1 times [2022-11-19 06:57:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:40,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801156907] [2022-11-19 06:57:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:41,100 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-19 06:57:41,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801156907] [2022-11-19 06:57:41,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801156907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065402183] [2022-11-19 06:57:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:41,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:57:41,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:57:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:41,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:57:41,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:41,327 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-19 06:57:41,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:57:41,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065402183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:57:41,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:57:41,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:57:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226379608] [2022-11-19 06:57:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:57:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:57:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:57:41,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:57:41,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:41,331 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:57:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:57:41,377 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-11-19 06:57:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:57:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-11-19 06:57:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:57:41,380 INFO L225 Difference]: With dead ends: 72 [2022-11-19 06:57:41,380 INFO L226 Difference]: Without dead ends: 60 [2022-11-19 06:57:41,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:57:41,381 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:57:41,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:57:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-19 06:57:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-19 06:57:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.131578947368421) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-19 06:57:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-19 06:57:41,394 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 60 [2022-11-19 06:57:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:57:41,395 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-19 06:57:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-19 06:57:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-19 06:57:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 06:57:41,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:57:41,400 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:57:41,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:57:41,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:41,607 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-19 06:57:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:57:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash 87309473, now seen corresponding path program 1 times [2022-11-19 06:57:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:57:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257832187] [2022-11-19 06:57:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:57:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:41,856 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-19 06:57:41,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:57:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257832187] [2022-11-19 06:57:41,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257832187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:57:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307906274] [2022-11-19 06:57:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:57:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:57:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:57:41,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:57:41,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:57:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:57:42,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:57:42,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:57:42,149 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-19 06:57:42,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:57:42,287 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-19 06:57:42,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307906274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:57:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [150017389] [2022-11-19 06:57:42,318 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-19 06:57:42,318 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:57:42,324 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:57:42,331 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:57:42,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:57:42,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:43,159 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:57:43,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:57:43,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:57:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:43,269 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:57:43,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:57:43,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:43,587 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:57:43,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:57:43,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:57:43,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:43,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:57:45,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,378 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:57:45,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:57:45,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,734 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:57:45,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:57:45,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:45,809 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:57:45,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:57:45,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:57:45,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:57:46,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:57:46,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:57:50,007 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 06:57:50,011 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:57:50,068 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-19 06:57:50,235 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 06:57:50,240 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:58:05,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [150017389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:58:05,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:58:05,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 45 [2022-11-19 06:58:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190947991] [2022-11-19 06:58:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:58:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:58:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:58:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:58:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2022-11-19 06:58:05,687 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:58:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:58:06,758 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-11-19 06:58:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:58:06,760 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-11-19 06:58:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:58:06,763 INFO L225 Difference]: With dead ends: 105 [2022-11-19 06:58:06,763 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 06:58:06,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=278, Invalid=1884, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:58:06,767 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:58:06,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 294 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 397 Unchecked, 0.5s Time] [2022-11-19 06:58:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 06:58:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-11-19 06:58:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 68 states have internal predecessors, (70), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:58:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-19 06:58:06,804 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 65 [2022-11-19 06:58:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:58:06,807 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-19 06:58:06,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:58:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-19 06:58:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 06:58:06,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:58:06,811 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:58:06,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:58:07,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:58:07,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:58:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:58:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1588373473, now seen corresponding path program 1 times [2022-11-19 06:58:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:58:07,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274055324] [2022-11-19 06:58:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:58:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:58:07,215 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-19 06:58:07,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:58:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274055324] [2022-11-19 06:58:07,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274055324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:58:07,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349596996] [2022-11-19 06:58:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:07,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:58:07,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:58:07,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:58:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:58:07,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:58:07,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:58:07,429 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-19 06:58:07,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:58:07,569 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-19 06:58:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349596996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:58:07,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [708802042] [2022-11-19 06:58:07,574 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-19 06:58:07,574 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:58:07,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:58:07,575 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:58:07,576 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:58:07,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:07,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:08,101 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:58:08,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:58:08,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:08,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:58:08,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:08,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 06:58:08,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:08,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:08,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:58:09,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:09,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:09,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,304 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:58:09,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:58:09,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:58:09,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:58:09,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,479 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:58:09,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-11-19 06:58:09,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:09,765 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:58:09,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-11-19 06:58:20,805 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 06:58:20,808 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 198 for LOIs [2022-11-19 06:58:20,958 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-11-19 06:58:20,960 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-19 06:58:20,970 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:58:48,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [708802042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:58:48,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:58:48,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [5, 5, 5] total 44 [2022-11-19 06:58:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223254183] [2022-11-19 06:58:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:58:48,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:58:48,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:58:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:58:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:58:48,352 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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-19 06:58:48,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:58:48,850 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-11-19 06:58:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:58:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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 66 [2022-11-19 06:58:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:58:48,855 INFO L225 Difference]: With dead ends: 108 [2022-11-19 06:58:48,856 INFO L226 Difference]: Without dead ends: 86 [2022-11-19 06:58:48,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 147 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=246, Invalid=1734, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:58:48,859 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:58:48,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 678 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 493 Unchecked, 0.4s Time] [2022-11-19 06:58:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-19 06:58:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-11-19 06:58:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 56 states have internal predecessors, (57), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:58:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2022-11-19 06:58:48,885 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 66 [2022-11-19 06:58:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:58:48,885 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2022-11-19 06:58:48,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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-19 06:58:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-11-19 06:58:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:58:48,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:58:48,887 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:58:48,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:58:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 06:58:49,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-19 06:58:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:58:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1468235832, now seen corresponding path program 1 times [2022-11-19 06:58:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:58:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995166960] [2022-11-19 06:58:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:58:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:58:49,300 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-19 06:58:49,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:58:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995166960] [2022-11-19 06:58:49,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995166960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:58:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703544342] [2022-11-19 06:58:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:58:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:58:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:58:49,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:58:49,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:58:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:58:49,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:58:49,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:58:49,516 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-19 06:58:49,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:58:49,628 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-19 06:58:49,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703544342] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:58:49,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298277331] [2022-11-19 06:58:49,631 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:58:49,632 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:58:49,633 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:58:49,633 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:58:49,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:58:49,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:49,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:49,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:49,943 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:58:49,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:58:49,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:50,164 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:58:50,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:58:50,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:50,447 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:58:50,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:58:50,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:50,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:58:51,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,497 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:58:51,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:58:51,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,793 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:58:51,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:58:51,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:51,874 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:58:51,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:58:51,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:51,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:58:52,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:58:52,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:58:55,041 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 06:58:55,043 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 171 for LOIs [2022-11-19 06:58:55,173 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-19 06:58:55,287 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:58:55,406 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:59:17,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [298277331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:59:17,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:59:17,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:59:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873452261] [2022-11-19 06:59:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:59:17,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:59:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:59:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:59:17,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:59:17,014 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:59:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:59:17,317 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-11-19 06:59:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:59:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 06:59:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:59:17,319 INFO L225 Difference]: With dead ends: 110 [2022-11-19 06:59:17,319 INFO L226 Difference]: Without dead ends: 109 [2022-11-19 06:59:17,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:59:17,321 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:59:17,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 490 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 327 Unchecked, 0.3s Time] [2022-11-19 06:59:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-19 06:59:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-11-19 06:59:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.088235294117647) internal successors, (74), 73 states have internal predecessors, (74), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:59:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2022-11-19 06:59:17,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 67 [2022-11-19 06:59:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:59:17,354 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2022-11-19 06:59:17,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:59:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-11-19 06:59:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:59:17,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:59:17,356 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:59:17,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:59:17,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:59:17,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:59:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:59:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -444824086, now seen corresponding path program 1 times [2022-11-19 06:59:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:59:17,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720417088] [2022-11-19 06:59:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:59:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:59:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:59:17,735 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-19 06:59:17,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:59:17,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720417088] [2022-11-19 06:59:17,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720417088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:59:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099548361] [2022-11-19 06:59:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:59:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:59:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:59:17,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:59:17,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:59:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:59:17,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:59:17,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:59:17,948 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-19 06:59:17,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:59:18,056 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-19 06:59:18,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099548361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:59:18,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [365666513] [2022-11-19 06:59:18,065 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:59:18,066 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:59:18,066 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:59:18,067 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:59:18,067 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:59:18,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:18,500 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:59:18,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:59:18,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:18,791 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:59:18,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:59:18,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:18,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 06:59:18,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:18,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:18,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:59:19,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:19,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:19,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:19,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:19,958 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:59:19,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:59:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:20,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:20,301 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:59:20,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 06:59:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:20,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:59:20,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:59:20,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:20,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:20,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:20,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:59:23,409 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 06:59:23,411 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 06:59:23,540 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-19 06:59:23,657 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:59:23,808 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:59:47,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [365666513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:59:47,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:59:47,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 06:59:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728906191] [2022-11-19 06:59:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:59:47,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 06:59:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:59:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 06:59:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 06:59:47,042 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:59:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:59:47,919 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2022-11-19 06:59:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 06:59:47,920 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-11-19 06:59:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:59:47,921 INFO L225 Difference]: With dead ends: 142 [2022-11-19 06:59:47,921 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 06:59:47,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 153 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 06:59:47,923 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:59:47,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 422 Unchecked, 0.3s Time] [2022-11-19 06:59:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 06:59:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2022-11-19 06:59:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 83 states have (on average 1.072289156626506) internal successors, (89), 88 states have internal predecessors, (89), 30 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-19 06:59:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2022-11-19 06:59:47,964 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 67 [2022-11-19 06:59:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:59:47,965 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2022-11-19 06:59:47,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 06:59:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-11-19 06:59:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:59:47,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:59:47,967 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:59:47,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:59:48,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 06:59:48,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:59:48,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:59:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1729329304, now seen corresponding path program 1 times [2022-11-19 06:59:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:59:48,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96391091] [2022-11-19 06:59:48,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:59:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:59:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:59:48,359 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-19 06:59:48,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:59:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96391091] [2022-11-19 06:59:48,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96391091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:59:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452918675] [2022-11-19 06:59:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:59:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:59:48,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:59:48,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:59:48,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:59:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:59:48,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 06:59:48,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:59:48,574 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-19 06:59:48,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:59:48,674 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-19 06:59:48,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452918675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:59:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1776359082] [2022-11-19 06:59:48,678 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:59:48,678 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:59:48,679 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:59:48,679 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:59:48,679 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:59:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:48,986 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:59:48,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 06:59:49,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:49,188 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:59:49,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 06:59:49,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:49,466 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:59:49,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 06:59:49,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:49,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:49,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:59:50,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:50,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:59:50,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,509 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:59:50,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 06:59:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,587 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:59:50,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 06:59:50,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:50,784 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:59:50,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-19 06:59:51,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:51,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:51,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:51,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:51,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:59:51,062 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:59:51,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 205 [2022-11-19 06:59:52,302 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 06:59:52,304 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 65 for LOIs [2022-11-19 06:59:52,318 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-11-19 06:59:52,397 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:59:52,535 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:00:04,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1776359082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:04,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:00:04,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 07:00:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282130610] [2022-11-19 07:00:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:04,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 07:00:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:00:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 07:00:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1943, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 07:00:04,838 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 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-19 07:00:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:06,911 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-19 07:00:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 07:00:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 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 68 [2022-11-19 07:00:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:06,914 INFO L225 Difference]: With dead ends: 141 [2022-11-19 07:00:06,914 INFO L226 Difference]: Without dead ends: 94 [2022-11-19 07:00:06,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=225, Invalid=2031, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 07:00:06,916 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:06,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 659 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 937 Invalid, 0 Unknown, 333 Unchecked, 1.5s Time] [2022-11-19 07:00:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-19 07:00:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-11-19 07:00:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 61 states have internal predecessors, (62), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 07:00:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-19 07:00:06,944 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 68 [2022-11-19 07:00:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:06,944 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-19 07:00:06,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 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-19 07:00:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-19 07:00:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 07:00:06,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:06,946 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:00:06,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:07,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:00:07,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:00:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash -904644618, now seen corresponding path program 1 times [2022-11-19 07:00:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:00:07,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122010943] [2022-11-19 07:00:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:07,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:00:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:07,315 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-19 07:00:07,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:00:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122010943] [2022-11-19 07:00:07,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122010943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:00:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415192110] [2022-11-19 07:00:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:00:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:00:07,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:00:07,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:00:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:07,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:00:07,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:07,540 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-19 07:00:07,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:07,649 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-19 07:00:07,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415192110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:00:07,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2076398018] [2022-11-19 07:00:07,653 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 07:00:07,653 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:00:07,653 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:00:07,654 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:00:07,654 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:00:07,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:07,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:07,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:08,074 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 07:00:08,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-11-19 07:00:08,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:08,142 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 07:00:08,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-11-19 07:00:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:08,387 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 07:00:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 07:00:08,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:08,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 07:00:09,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:09,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,461 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 07:00:09,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 07:00:09,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,745 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 07:00:09,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-19 07:00:09,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:00:09,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 07:00:09,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:09,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 07:00:12,738 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 07:00:12,740 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 07:00:12,864 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-11-19 07:00:12,963 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 07:00:13,070 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:00:32,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2076398018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:32,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:00:32,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 5] total 46 [2022-11-19 07:00:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288493824] [2022-11-19 07:00:32,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:32,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-19 07:00:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:00:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-19 07:00:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1885, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 07:00:32,616 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:00:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:33,298 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-19 07:00:33,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 07:00:33,299 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 68 [2022-11-19 07:00:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:33,300 INFO L225 Difference]: With dead ends: 97 [2022-11-19 07:00:33,300 INFO L226 Difference]: Without dead ends: 73 [2022-11-19 07:00:33,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 155 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 07:00:33,302 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:33,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 342 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 607 Unchecked, 0.2s Time] [2022-11-19 07:00:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-19 07:00:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2022-11-19 07:00:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-19 07:00:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-19 07:00:33,322 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 68 [2022-11-19 07:00:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:33,322 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-19 07:00:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 07:00:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-19 07:00:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 07:00:33,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:00:33,323 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:00:33,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 07:00:33,526 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 07:00:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:00:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1188993857, now seen corresponding path program 1 times [2022-11-19 07:00:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:00:33,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852256555] [2022-11-19 07:00:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:00:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:33,667 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-19 07:00:33,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:00:33,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852256555] [2022-11-19 07:00:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852256555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:00:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345346112] [2022-11-19 07:00:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:00:33,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:00:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:00:33,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:00:33,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:00:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:00:33,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:00:33,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:00:33,856 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-19 07:00:33,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:00:33,937 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-19 07:00:33,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345346112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:00:33,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [297367931] [2022-11-19 07:00:33,939 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 07:00:33,939 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:00:33,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:00:33,940 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:00:33,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:00:34,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:34,287 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 07:00:34,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-11-19 07:00:34,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:34,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:34,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-11-19 07:00:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:34,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-19 07:00:34,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:34,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 07:00:35,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:35,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 07:00:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,213 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 07:00:35,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-11-19 07:00:35,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,266 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:00:35,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-11-19 07:00:35,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,414 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 07:00:35,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-19 07:00:35,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:00:35,614 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 07:00:35,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 157 treesize of output 205 [2022-11-19 07:00:36,538 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-11-19 07:00:36,554 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 60 for LOIs [2022-11-19 07:00:36,564 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-11-19 07:00:36,639 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 07:00:36,670 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:00:47,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [297367931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:00:47,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:00:47,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [5, 5, 5] total 47 [2022-11-19 07:00:47,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28055291] [2022-11-19 07:00:47,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:00:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-19 07:00:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:00:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-19 07:00:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2022-11-19 07:00:47,880 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 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-19 07:00:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:00:49,581 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-19 07:00:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-19 07:00:49,581 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 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 69 [2022-11-19 07:00:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:00:49,582 INFO L225 Difference]: With dead ends: 73 [2022-11-19 07:00:49,582 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:00:49,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 154 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=230, Invalid=2122, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 07:00:49,584 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:00:49,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 109 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 772 Invalid, 0 Unknown, 127 Unchecked, 1.2s Time] [2022-11-19 07:00:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:00:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:00:49,585 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-19 07:00:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:00:49,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-19 07:00:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:00:49,586 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:00:49,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 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-19 07:00:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:00:49,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:00:49,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 07:00:49,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 07:00:49,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 07:00:49,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 07:00:49,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 07:00:49,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 07:00:49,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 07:00:49,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 07:00:49,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:00:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:00:49,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:01:16,422 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 07:01:16,422 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 07:01:16,422 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-11-19 07:01:16,422 INFO L902 garLoopResultBuilder]: At program point staticReturnsFalseENTRY(lines 1552 1555) the Hoare annotation is: true [2022-11-19 07:01:16,422 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 07:01:16,423 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 07:01:16,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-11-19 07:01:16,423 INFO L895 garLoopResultBuilder]: At program point L1596(line 1596) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse27 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 07:01:16,424 INFO L899 garLoopResultBuilder]: For program point L1596-1(line 1596) no Hoare annotation was computed. [2022-11-19 07:01:16,424 INFO L899 garLoopResultBuilder]: For program point L1596-2(lines 1596 1609) no Hoare annotation was computed. [2022-11-19 07:01:16,424 INFO L895 garLoopResultBuilder]: At program point L1596-4(lines 1596 1609) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse39 (store ((as const (Array Int Int)) 0) 0 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse39) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse39) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-19 07:01:16,425 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,425 INFO L899 garLoopResultBuilder]: For program point L1588-1(lines 1574 1590) no Hoare annotation was computed. [2022-11-19 07:01:16,425 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1589) no Hoare annotation was computed. [2022-11-19 07:01:16,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-19 07:01:16,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: false [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point L1614-1(line 1614) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L895 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-11-19 07:01:16,426 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-11-19 07:01:16,427 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 07:01:16,427 INFO L899 garLoopResultBuilder]: For program point L1639-1(line 1639) no Hoare annotation was computed. [2022-11-19 07:01:16,427 INFO L899 garLoopResultBuilder]: For program point L1606-1(lines 1600 1607) no Hoare annotation was computed. [2022-11-19 07:01:16,427 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1582(line 1582) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1582-1(line 1582) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-19 07:01:16,428 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1590) no Hoare annotation was computed. [2022-11-19 07:01:16,429 INFO L899 garLoopResultBuilder]: For program point L1624(lines 1624 1644) no Hoare annotation was computed. [2022-11-19 07:01:16,429 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: (let ((.cse17 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse33 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse34 (= ~globalArgv~0.base 0)) (.cse35 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse36 (= (select (select |#memory_int| 6) 0) 0)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .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 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse52 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse10 .cse12 .cse13 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse53 .cse22 .cse24 .cse29 .cse34 .cse40 .cse41 .cse42 .cse43 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse54 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse11) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse11 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse54 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 07:01:16,430 INFO L895 garLoopResultBuilder]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse28 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse28 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse28 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-19 07:01:16,430 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-11-19 07:01:16,431 INFO L895 garLoopResultBuilder]: At program point L1649-4(lines 1649 1652) the Hoare annotation is: (let ((.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse43 (store ((as const (Array Int Int)) 0) 0 0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse43) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse52 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse10 .cse11 .cse12 .cse53 .cse16 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse54 .cse20 .cse26 .cse31 .cse37 .cse38 .cse40 .cse41 .cse42 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse43) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 07:01:16,431 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-19 07:01:16,432 INFO L895 garLoopResultBuilder]: At program point L1641(line 1641) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse1 .cse3 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse11 .cse12 .cse13 .cse52 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse22 .cse23 .cse29 .cse33 .cse39 .cse40 .cse42 .cse43 .cse46 (<= 0 |#StackHeapBarrier|) .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse14) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse15 .cse16 .cse17 .cse52 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse53 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse53 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse14) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51))) [2022-11-19 07:01:16,432 INFO L902 garLoopResultBuilder]: At program point L1674-1(line 1674) the Hoare annotation is: true [2022-11-19 07:01:16,432 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1607) no Hoare annotation was computed. [2022-11-19 07:01:16,432 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-19 07:01:16,432 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1623) no Hoare annotation was computed. [2022-11-19 07:01:16,432 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,433 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-11-19 07:01:16,433 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-11-19 07:01:16,433 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,433 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-11-19 07:01:16,433 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point L1610-1(lines 1610 1622) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-11-19 07:01:16,434 INFO L899 garLoopResultBuilder]: For program point L1636-1(lines 1636 1643) no Hoare annotation was computed. [2022-11-19 07:01:16,435 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 07:01:16,435 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-11-19 07:01:16,435 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-11-19 07:01:16,436 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse51 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 2) 1)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse14 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse14) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse15 .cse16 .cse17 .cse51 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse1 .cse3 .cse5 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse12 .cse13 .cse51 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse22 .cse23 .cse32 .cse38 .cse39 .cse41 .cse42 .cse45 (<= 0 |#StackHeapBarrier|) .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse14) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-11-19 07:01:16,436 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2022-11-19 07:01:16,436 INFO L899 garLoopResultBuilder]: For program point L1628-2(lines 1628 1635) no Hoare annotation was computed. [2022-11-19 07:01:16,437 INFO L895 garLoopResultBuilder]: At program point L1628-3(lines 1628 1635) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse7 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse5 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse17 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse18 (= (select |#length| 6) 1)) (.cse19 (= 1 (select |#valid| 5))) (.cse20 (= (select (select |#memory_int| 2) 0) 0)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse22 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse23 (= (select |#valid| 9) 1)) (.cse24 (= (select |#valid| 11) 1)) (.cse25 (= (select (select |#memory_int| 1) 0) 0)) (.cse3 (= ~globalArgv~0.offset 0)) (.cse4 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse27 (= (select |#valid| 3) 1)) (.cse28 (= 21 (select |#length| 4))) (.cse29 (= (select |#valid| 7) 1)) (.cse6 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= (select |#length| 10) 18)) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse8 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse33 (= 16 (select |#length| 7))) (.cse34 (= (select |#length| 5) 54)) (.cse35 (= (select |#valid| 4) 1)) (.cse36 (= 16 (select |#length| 3))) (.cse37 (= (select |#length| 2) 1)) (.cse38 (= (select |#valid| 1) 1)) (.cse39 (= 16 (select |#length| 11))) (.cse40 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse9 (= ~globalArgv~0.base 0)) (.cse41 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse42 (= (select (select |#memory_int| 6) 0) 0)) (.cse43 (= (select |#valid| 0) 0)) (.cse44 (= (select |#length| 1) 1)) (.cse45 (= (select |#valid| 2) 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (= ~globalFalse~0 0)) (.cse46 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse12 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse13 (= ~globalArgc~0 0)) (.cse26 (store ((as const (Array Int Int)) 0) 0 0)) (.cse47 (= (select |#valid| 6) 1)) (.cse48 (= (select |#length| 8) 54)) (.cse14 (= 5 ~globalFive~0)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= (select |#valid| 8) 1)) (.cse51 (< 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0)) (.cse16 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |#StackHeapBarrier|) .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse26 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse27 .cse28 .cse29 .cse6 .cse30 .cse31 .cse32 .cse7 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 .cse10 .cse11 .cse46 .cse12 .cse13 .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse26) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse4 .cse27 .cse28 .cse29 .cse5 .cse6 .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse10 .cse11 .cse12 .cse13 .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse3 .cse4 .cse27 .cse28 .cse29 .cse6 .cse30 .cse31 .cse32 .cse8 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse9 .cse41 .cse42 .cse43 .cse44 .cse45 .cse10 .cse11 .cse46 .cse12 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse26) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse15 .cse16))) [2022-11-19 07:01:16,437 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-11-19 07:01:16,438 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 0)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10| 11)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse11) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-19 07:01:16,438 INFO L899 garLoopResultBuilder]: For program point L1653-1(lines 1653 1660) no Hoare annotation was computed. [2022-11-19 07:01:16,438 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1661) no Hoare annotation was computed. [2022-11-19 07:01:16,438 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1621) no Hoare annotation was computed. [2022-11-19 07:01:16,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-19 07:01:16,438 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-11-19 07:01:16,439 INFO L902 garLoopResultBuilder]: At program point staticReturnsTrueENTRY(lines 1548 1551) the Hoare annotation is: true [2022-11-19 07:01:16,441 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:01:16,443 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:01:16,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:01:16 BoogieIcfgContainer [2022-11-19 07:01:16,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:01:16,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:01:16,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:01:16,453 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:01:16,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:57:36" (3/4) ... [2022-11-19 07:01:16,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:01:16,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 07:01:16,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-11-19 07:01:16,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 07:01:16,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-11-19 07:01:16,468 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 07:01:16,468 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-19 07:01:16,468 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 07:01:16,469 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:01:16,469 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:01:16,516 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:01:16,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:01:16,517 INFO L158 Benchmark]: Toolchain (without parser) took 222344.12ms. Allocated memory was 104.9MB in the beginning and 448.8MB in the end (delta: 343.9MB). Free memory was 70.3MB in the beginning and 376.0MB in the end (delta: -305.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,517 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:01:16,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1569.16ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 70.1MB in the beginning and 92.4MB in the end (delta: -22.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.97ms. Allocated memory is still 140.5MB. Free memory was 91.7MB in the beginning and 89.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,518 INFO L158 Benchmark]: Boogie Preprocessor took 36.48ms. Allocated memory is still 140.5MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,519 INFO L158 Benchmark]: RCFGBuilder took 883.59ms. Allocated memory is still 140.5MB. Free memory was 86.9MB in the beginning and 109.4MB in the end (delta: -22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,519 INFO L158 Benchmark]: TraceAbstraction took 219705.41ms. Allocated memory was 140.5MB in the beginning and 448.8MB in the end (delta: 308.3MB). Free memory was 108.3MB in the beginning and 380.2MB in the end (delta: -271.9MB). Peak memory consumption was 278.2MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,519 INFO L158 Benchmark]: Witness Printer took 63.51ms. Allocated memory is still 448.8MB. Free memory was 380.2MB in the beginning and 376.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:01:16,521 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.34ms. Allocated memory is still 104.9MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1569.16ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 70.1MB in the beginning and 92.4MB in the end (delta: -22.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.97ms. Allocated memory is still 140.5MB. Free memory was 91.7MB in the beginning and 89.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.48ms. Allocated memory is still 140.5MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 883.59ms. Allocated memory is still 140.5MB. Free memory was 86.9MB in the beginning and 109.4MB in the end (delta: -22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 219705.41ms. Allocated memory was 140.5MB in the beginning and 448.8MB in the end (delta: 308.3MB). Free memory was 108.3MB in the beginning and 380.2MB in the end (delta: -271.9MB). Peak memory consumption was 278.2MB. Max. memory is 16.1GB. * Witness Printer took 63.51ms. Allocated memory is still 448.8MB. Free memory was 380.2MB in the beginning and 376.0MB 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 219.6s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 5257 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2706 IncrementalHoareTripleChecker+Unchecked, 4032 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2564 IncrementalHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1225 mSDtfsCounter, 2564 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1614 GetRequests, 1214 SyntacticMatches, 53 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5279 ImplicationChecksByTransitivity, 133.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=15, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 111 PreInvPairs, 148 NumberOfFragments, 8631 HoareAnnotationTreeSize, 111 FomulaSimplifications, 838 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 25 FomulaSimplificationsInter, 34622 FormulaSimplificationTreeSizeReductionInter, 25.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1485 NumberOfCodeBlocks, 1485 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 2349 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2883 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 943/968 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: 44.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 35, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 414, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 274, TOOLS_POST_TIME: 19.8s, TOOLS_POST_CALL_APPLICATIONS: 252, TOOLS_POST_CALL_TIME: 11.2s, TOOLS_POST_RETURN_APPLICATIONS: 168, TOOLS_POST_RETURN_TIME: 7.9s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 694, TOOLS_QUANTIFIERELIM_TIME: 38.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 982, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 224, DOMAIN_JOIN_TIME: 4.2s, 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: 414, DOMAIN_ISBOTTOM_TIME: 1.2s, 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: 168, CALL_SUMMARIZER_CACHE_MISSES: 28, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 13031, DAG_COMPRESSION_RETAINED_NODES: 1003, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1674]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-19 07:01:16,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39a8c074-17ec-4eb1-abd7-e1ba5c9f80dc/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE