./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_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_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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 ef81808dbabc5963dd9b655eb43a7ab624abda13c0587648533de73800c0fdb5 --- 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:48:22,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:48:22,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:48:22,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:48:22,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:48:22,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:48:22,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:48:22,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:48:22,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:48:22,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:48:22,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:48:22,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:48:22,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:48:22,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:48:22,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:48:22,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:48:22,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:48:22,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:48:22,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:48:22,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:48:22,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:48:22,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:48:22,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:48:22,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:48:22,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:48:22,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:48:22,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:48:22,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:48:22,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:48:22,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:48:22,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:48:22,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:48:22,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:48:22,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:48:22,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:48:22,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:48:22,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:48:22,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:48:22,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:48:22,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:48:22,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:48:22,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-19 06:48:22,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:48:22,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:48:22,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:48:22,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:48:22,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:48:22,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:48:22,269 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:48:22,269 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:48:22,270 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:48:22,270 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:48:22,270 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:48:22,270 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:48:22,270 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:48:22,271 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:48:22,271 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:48:22,271 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:48:22,271 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:48:22,272 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:48:22,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:48:22,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 06:48:22,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:48:22,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:48:22,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:48:22,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:48:22,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:48:22,274 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 06:48:22,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:48:22,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:48:22,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:48:22,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:48:22,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:48:22,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:48:22,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:48:22,276 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:48:22,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:48:22,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:48:22,277 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:48:22,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:48:22,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:48:22,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:48:22,278 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_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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 -> ef81808dbabc5963dd9b655eb43a7ab624abda13c0587648533de73800c0fdb5 [2022-11-19 06:48:22,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:48:22,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:48:22,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:48:22,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:48:22,542 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:48:22,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-11-19 06:48:22,614 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/data/095f98e44/9e961333f4a34f0a98dc8c4d5641de71/FLAG061ddf63c [2022-11-19 06:48:23,194 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:48:23,195 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-11-19 06:48:23,217 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/data/095f98e44/9e961333f4a34f0a98dc8c4d5641de71/FLAG061ddf63c [2022-11-19 06:48:23,400 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/data/095f98e44/9e961333f4a34f0a98dc8c4d5641de71 [2022-11-19 06:48:23,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:48:23,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:48:23,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:48:23,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:48:23,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:48:23,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:23" (1/1) ... [2022-11-19 06:48:23,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f663250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:23, skipping insertion in model container [2022-11-19 06:48:23,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:23" (1/1) ... [2022-11-19 06:48:23,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:48:23,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:48:23,862 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:48:24,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:48:24,375 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:48:24,407 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-19 06:48:24,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:48:24,648 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:48:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24 WrapperNode [2022-11-19 06:48:24,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:48:24,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:48:24,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:48:24,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:48:24,657 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:48:24" (1/1) ... [2022-11-19 06:48:24,703 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:48:24" (1/1) ... [2022-11-19 06:48:24,753 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2022-11-19 06:48:24,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:48:24,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:48:24,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:48:24,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:48:24,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,793 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:48:24,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:48:24,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:48:24,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:48:24,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (1/1) ... [2022-11-19 06:48:24,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:48:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:24,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:48:24,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:48:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-19 06:48:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-19 06:48:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-19 06:48:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-19 06:48:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-19 06:48:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-19 06:48:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-19 06:48:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:48:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-19 06:48:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:48:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:48:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:48:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:48:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-19 06:48:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-19 06:48:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-19 06:48:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:48:25,095 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:48:25,097 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:48:25,378 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:48:25,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:48:25,425 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:48:25,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:25 BoogieIcfgContainer [2022-11-19 06:48:25,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:48:25,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:48:25,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:48:25,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:48:25,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:48:23" (1/3) ... [2022-11-19 06:48:25,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51709a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:25, skipping insertion in model container [2022-11-19 06:48:25,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:24" (2/3) ... [2022-11-19 06:48:25,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51709a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:25, skipping insertion in model container [2022-11-19 06:48:25,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:25" (3/3) ... [2022-11-19 06:48:25,437 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-11-19 06:48:25,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:48:25,456 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-19 06:48:25,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:48:25,524 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;@472106fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:48:25,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-19 06:48:25,529 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:48:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:48:25,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:25,538 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:48:25,538 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:48:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:25,544 INFO L85 PathProgramCache]: Analyzing trace with hash 63524263, now seen corresponding path program 1 times [2022-11-19 06:48:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:25,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992246202] [2022-11-19 06:48:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:25,956 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:48:25,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992246202] [2022-11-19 06:48:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992246202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:25,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:48:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366341261] [2022-11-19 06:48:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:25,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:25,995 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:48:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:26,075 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-19 06:48:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:26,078 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:48:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:26,087 INFO L225 Difference]: With dead ends: 137 [2022-11-19 06:48:26,087 INFO L226 Difference]: Without dead ends: 68 [2022-11-19 06:48:26,090 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:48:26,094 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:26,095 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.0s Time] [2022-11-19 06:48:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-19 06:48:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-19 06:48:26,139 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:48:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-19 06:48:26,143 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-19 06:48:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:26,144 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-19 06:48:26,144 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:48:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-19 06:48:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:48:26,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:26,146 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:48:26,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:48:26,147 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:48:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 182324300, now seen corresponding path program 1 times [2022-11-19 06:48:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:26,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180159548] [2022-11-19 06:48:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:26,226 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:48:26,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:26,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180159548] [2022-11-19 06:48:26,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180159548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:26,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:26,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218197767] [2022-11-19 06:48:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:26,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:26,234 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:48:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:26,300 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2022-11-19 06:48:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:26,302 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:48:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:26,304 INFO L225 Difference]: With dead ends: 163 [2022-11-19 06:48:26,304 INFO L226 Difference]: Without dead ends: 113 [2022-11-19 06:48:26,305 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:48:26,306 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:26,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-19 06:48:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 72. [2022-11-19 06:48:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.380952380952381) internal successors, (58), 55 states have internal predecessors, (58), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2022-11-19 06:48:26,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 19 [2022-11-19 06:48:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:26,322 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-11-19 06:48:26,322 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:48:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2022-11-19 06:48:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:48:26,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:26,328 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:48:26,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:48:26,329 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:48:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1357086081, now seen corresponding path program 1 times [2022-11-19 06:48:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:26,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834405605] [2022-11-19 06:48:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:26,495 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:48:26,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:26,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834405605] [2022-11-19 06:48:26,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834405605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:26,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668226298] [2022-11-19 06:48:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:26,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:26,501 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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:48:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:26,549 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-19 06:48:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:26,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:48:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:26,556 INFO L225 Difference]: With dead ends: 72 [2022-11-19 06:48:26,556 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:48:26,557 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:48:26,558 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 40 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:26,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 97 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:48:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 06:48:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 54 states have internal predecessors, (57), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-11-19 06:48:26,581 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 20 [2022-11-19 06:48:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:26,581 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-11-19 06:48:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:48:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-11-19 06:48:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-19 06:48:26,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:26,586 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:48:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:48:26,586 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:48:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -88191861, now seen corresponding path program 1 times [2022-11-19 06:48:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93090906] [2022-11-19 06:48:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:26,684 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:48:26,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:26,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93090906] [2022-11-19 06:48:26,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93090906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:26,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:26,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:48:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633763501] [2022-11-19 06:48:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:26,687 INFO L87 Difference]: Start difference. First operand 71 states and 95 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:48:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:26,721 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2022-11-19 06:48:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:26,721 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:48:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:26,723 INFO L225 Difference]: With dead ends: 119 [2022-11-19 06:48:26,723 INFO L226 Difference]: Without dead ends: 70 [2022-11-19 06:48:26,723 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:48:26,725 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:48:26,725 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:48:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-19 06:48:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-19 06:48:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 53 states have internal predecessors, (55), 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:48:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-19 06:48:26,735 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2022-11-19 06:48:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:26,735 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-19 06:48:26,735 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:48:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-19 06:48:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 06:48:26,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:26,737 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:48:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:48:26,737 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:48:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash 98416322, now seen corresponding path program 1 times [2022-11-19 06:48:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822144168] [2022-11-19 06:48:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:26,886 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:48:26,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:26,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822144168] [2022-11-19 06:48:26,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822144168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066931457] [2022-11-19 06:48:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:26,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:26,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:48:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:27,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:48:27,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:27,082 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:48:27,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:27,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066931457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:27,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:27,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:48:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638000331] [2022-11-19 06:48:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:27,086 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (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:48:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:27,159 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2022-11-19 06:48:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (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 34 [2022-11-19 06:48:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:27,161 INFO L225 Difference]: With dead ends: 134 [2022-11-19 06:48:27,162 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 06:48:27,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:27,164 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:27,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 175 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 06:48:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-11-19 06:48:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.297872340425532) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-19 06:48:27,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 34 [2022-11-19 06:48:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:27,193 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-19 06:48:27,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (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:48:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-19 06:48:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-19 06:48:27,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:27,195 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] [2022-11-19 06:48:27,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:27,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:27,401 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1244061203, now seen corresponding path program 1 times [2022-11-19 06:48:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:27,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738521066] [2022-11-19 06:48:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:27,514 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:48:27,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:27,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738521066] [2022-11-19 06:48:27,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738521066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:27,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350662050] [2022-11-19 06:48:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:27,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:27,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:27,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:48:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:27,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:48:27,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:27,719 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:48:27,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:27,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350662050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:27,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:27,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:48:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748005316] [2022-11-19 06:48:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:27,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:27,723 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (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:48:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:27,789 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2022-11-19 06:48:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (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 35 [2022-11-19 06:48:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:27,791 INFO L225 Difference]: With dead ends: 102 [2022-11-19 06:48:27,791 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 06:48:27,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:27,793 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:27,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 179 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 06:48:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2022-11-19 06:48:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-11-19 06:48:27,810 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 35 [2022-11-19 06:48:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:27,810 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-11-19 06:48:27,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (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:48:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-11-19 06:48:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-19 06:48:27,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:27,812 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:48:27,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:28,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:28,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1341109177, now seen corresponding path program 1 times [2022-11-19 06:48:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:28,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742189566] [2022-11-19 06:48:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,093 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:48:28,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:28,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742189566] [2022-11-19 06:48:28,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742189566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:28,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:28,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632115903] [2022-11-19 06:48:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:28,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:28,100 INFO L87 Difference]: Start difference. First operand 77 states and 100 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:48:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:28,142 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-11-19 06:48:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:28,144 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:48:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:28,147 INFO L225 Difference]: With dead ends: 100 [2022-11-19 06:48:28,148 INFO L226 Difference]: Without dead ends: 99 [2022-11-19 06:48:28,148 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:48:28,150 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:28,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-19 06:48:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-11-19 06:48:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-19 06:48:28,162 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 36 [2022-11-19 06:48:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:28,163 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-19 06:48:28,163 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:48:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-19 06:48:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:48:28,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:28,165 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:48:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:48:28,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1375288584, now seen corresponding path program 1 times [2022-11-19 06:48:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149968383] [2022-11-19 06:48:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,234 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:48:28,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149968383] [2022-11-19 06:48:28,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149968383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:28,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:28,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896231112] [2022-11-19 06:48:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:28,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:28,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:28,237 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 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:48:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:28,262 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-19 06:48:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:28,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:48:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:28,264 INFO L225 Difference]: With dead ends: 76 [2022-11-19 06:48:28,264 INFO L226 Difference]: Without dead ends: 75 [2022-11-19 06:48:28,265 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:48:28,266 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:28,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-19 06:48:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-11-19 06:48:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 54 states have internal predecessors, (58), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-11-19 06:48:28,276 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2022-11-19 06:48:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:28,276 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-11-19 06:48:28,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:48:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-11-19 06:48:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 06:48:28,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:28,278 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] [2022-11-19 06:48:28,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 06:48:28,279 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:48:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1961623989, now seen corresponding path program 1 times [2022-11-19 06:48:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:28,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420721807] [2022-11-19 06:48:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:48:28,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:28,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420721807] [2022-11-19 06:48:28,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420721807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:28,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524877935] [2022-11-19 06:48:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:28,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:28,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:48:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:48:28,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:48:28,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:28,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524877935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:28,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:28,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:48:28,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29721916] [2022-11-19 06:48:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:28,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:28,509 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:48:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:28,532 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-11-19 06:48:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 44 [2022-11-19 06:48:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:28,533 INFO L225 Difference]: With dead ends: 73 [2022-11-19 06:48:28,533 INFO L226 Difference]: Without dead ends: 72 [2022-11-19 06:48:28,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:28,534 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:28,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-19 06:48:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-19 06:48:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-19 06:48:28,545 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 44 [2022-11-19 06:48:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:28,545 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-19 06:48:28,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:48:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-11-19 06:48:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 06:48:28,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:28,547 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:28,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:28,753 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 680801653, now seen corresponding path program 1 times [2022-11-19 06:48:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:28,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677437230] [2022-11-19 06:48:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 06:48:28,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677437230] [2022-11-19 06:48:28,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677437230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:28,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958803682] [2022-11-19 06:48:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:28,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:28,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:48:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:28,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:48:28,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 06:48:29,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:29,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958803682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:29,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:29,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:48:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233540664] [2022-11-19 06:48:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:29,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:29,018 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:48:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:29,052 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2022-11-19 06:48:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 45 [2022-11-19 06:48:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:29,057 INFO L225 Difference]: With dead ends: 89 [2022-11-19 06:48:29,058 INFO L226 Difference]: Without dead ends: 88 [2022-11-19 06:48:29,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:29,059 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:29,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-19 06:48:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-11-19 06:48:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.24) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-19 06:48:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-11-19 06:48:29,076 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 45 [2022-11-19 06:48:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:29,076 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-19 06:48:29,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 06:48:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-11-19 06:48:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 06:48:29,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:29,086 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] [2022-11-19 06:48:29,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:29,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1699985791, now seen corresponding path program 1 times [2022-11-19 06:48:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:29,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321839606] [2022-11-19 06:48:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 06:48:29,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321839606] [2022-11-19 06:48:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321839606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095265318] [2022-11-19 06:48:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:29,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:29,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:29,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:48:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:29,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:48:29,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:29,529 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:48:29,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:29,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095265318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:29,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:29,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-19 06:48:29,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177399573] [2022-11-19 06:48:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:29,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:29,535 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (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:48:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:29,570 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-11-19 06:48:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:29,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (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 48 [2022-11-19 06:48:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:29,573 INFO L225 Difference]: With dead ends: 77 [2022-11-19 06:48:29,574 INFO L226 Difference]: Without dead ends: 76 [2022-11-19 06:48:29,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:29,575 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:29,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-19 06:48:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-19 06:48:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 52 states have internal predecessors, (56), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-11-19 06:48:29,590 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 48 [2022-11-19 06:48:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:29,590 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-11-19 06:48:29,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (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:48:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-11-19 06:48:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 06:48:29,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:29,593 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:29,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-19 06:48:29,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-19 06:48:29,799 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:48:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1213882814, now seen corresponding path program 1 times [2022-11-19 06:48:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4894492] [2022-11-19 06:48:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:48:29,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4894492] [2022-11-19 06:48:29,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4894492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127588176] [2022-11-19 06:48:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:29,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:29,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:48:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:30,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:48:30,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-19 06:48:30,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127588176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:30,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:48:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514439552] [2022-11-19 06:48:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:30,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:30,052 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:48:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:30,089 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-11-19 06:48:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 54 [2022-11-19 06:48:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:30,096 INFO L225 Difference]: With dead ends: 107 [2022-11-19 06:48:30,097 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:48:30,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:30,099 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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:48:30,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:48:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 06:48:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-19 06:48:30,115 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 54 [2022-11-19 06:48:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:30,116 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-19 06:48:30,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:48:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-11-19 06:48:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-19 06:48:30,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:30,118 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:30,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:30,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-19 06:48:30,324 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:48:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2011693763, now seen corresponding path program 1 times [2022-11-19 06:48:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920386519] [2022-11-19 06:48:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 06:48:30,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920386519] [2022-11-19 06:48:30,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920386519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809332957] [2022-11-19 06:48:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:30,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:30,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:30,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:30,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:48:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:30,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:48:30,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 06:48:30,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:30,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809332957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:30,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:30,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:48:30,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997144478] [2022-11-19 06:48:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:30,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:30,546 INFO L87 Difference]: Start difference. First operand 71 states and 93 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:48:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:30,591 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-11-19 06:48:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:30,592 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 56 [2022-11-19 06:48:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:30,593 INFO L225 Difference]: With dead ends: 100 [2022-11-19 06:48:30,593 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:48:30,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:30,594 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 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:48:30,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:48:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 06:48:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 51 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-11-19 06:48:30,607 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 56 [2022-11-19 06:48:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:30,608 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-11-19 06:48:30,608 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-19 06:48:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-11-19 06:48:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 06:48:30,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:30,610 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:48:30,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:30,815 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:48:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -227559506, now seen corresponding path program 1 times [2022-11-19 06:48:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71069137] [2022-11-19 06:48:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:30,886 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:48:30,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:30,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71069137] [2022-11-19 06:48:30,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71069137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016408259] [2022-11-19 06:48:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:30,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:30,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:30,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:30,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:48:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:31,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:48:31,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:31,038 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:48:31,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:48:31,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016408259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:31,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:48:31,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-19 06:48:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470276756] [2022-11-19 06:48:31,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:31,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:31,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:31,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:31,041 INFO L87 Difference]: Start difference. First operand 71 states and 91 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:48:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:31,073 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-11-19 06:48:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:31,074 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:48:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:31,075 INFO L225 Difference]: With dead ends: 83 [2022-11-19 06:48:31,075 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 06:48:31,075 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:48:31,076 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 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:48:31,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:48:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 06:48:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-19 06:48:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-19 06:48:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-11-19 06:48:31,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 60 [2022-11-19 06:48:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:31,084 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-11-19 06:48:31,085 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:48:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-11-19 06:48:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-19 06:48:31,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:31,086 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:48:31,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 06:48:31,292 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:48:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 639997850, now seen corresponding path program 1 times [2022-11-19 06:48:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625612204] [2022-11-19 06:48:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:31,423 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:48:31,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:31,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625612204] [2022-11-19 06:48:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625612204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:31,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600774954] [2022-11-19 06:48:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:31,427 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:31,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:48:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:31,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:48:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:31,598 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:48:31,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:48:31,675 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:48:31,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600774954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:48:31,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723925331] [2022-11-19 06:48:31,695 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-19 06:48:31,695 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:48:31,699 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:48:31,704 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:48:31,704 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:48:32,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:32,269 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:48:32,270 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:48:32,305 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:48:32,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:32,346 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:48:32,346 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:48:32,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:32,592 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:48:32,592 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:48:32,653 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:48:32,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:32,791 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:48:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:33,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:33,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:33,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:33,974 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:48:33,974 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:48:34,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:34,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:34,248 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:48:34,249 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:48:34,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:34,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:34,302 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:48:34,302 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:48:34,375 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:48:34,392 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:48:34,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:34,542 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:48:37,512 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:48:37,514 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-11-19 06:48:37,550 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:48:37,687 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-19 06:48:37,691 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:48:48,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1723925331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:48,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:48:48,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-11-19 06:48:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668970729] [2022-11-19 06:48:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:48,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-19 06:48:48,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-19 06:48:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 06:48:48,305 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 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:48:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:49,124 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-11-19 06:48:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:48:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 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:48:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:49,126 INFO L225 Difference]: With dead ends: 118 [2022-11-19 06:48:49,126 INFO L226 Difference]: Without dead ends: 117 [2022-11-19 06:48:49,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=248, Invalid=1474, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:48:49,130 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 31 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:49,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 490 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 158 Invalid, 0 Unknown, 372 Unchecked, 0.4s Time] [2022-11-19 06:48:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-19 06:48:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2022-11-19 06:48:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.125) internal successors, (81), 76 states have internal predecessors, (81), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-19 06:48:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-11-19 06:48:49,161 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 65 [2022-11-19 06:48:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:49,162 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-11-19 06:48:49,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 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:48:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-11-19 06:48:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-19 06:48:49,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:49,164 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:48:49,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:48:49,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 06:48:49,369 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:48:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1634902970, now seen corresponding path program 1 times [2022-11-19 06:48:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472845245] [2022-11-19 06:48:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:49,489 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:48:49,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:49,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472845245] [2022-11-19 06:48:49,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472845245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:48:49,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304494613] [2022-11-19 06:48:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:48:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:49,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:48:49,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 06:48:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:49,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:48:49,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:48:49,649 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:48:49,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:48:49,717 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:48:49,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304494613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:48:49,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [631514527] [2022-11-19 06:48:49,720 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-19 06:48:49,720 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:48:49,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:48:49,721 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:48:49,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:48:49,991 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:48:50,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:50,180 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:48:50,181 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:48:50,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:50,209 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:48:50,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:50,233 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:48:50,254 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:48:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:50,335 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:48:51,183 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:48:51,194 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:48:51,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,245 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:48:51,245 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:48:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,311 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:48:51,312 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:48:51,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,375 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 06:48:51,377 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:48:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:48:51,614 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:48:51,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 181 treesize of output 229 [2022-11-19 06:49:00,687 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:49:00,690 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 198 for LOIs [2022-11-19 06:49:00,814 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:49:00,816 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-11-19 06:49:00,827 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:19,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [631514527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:19,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:49:19,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [4, 4, 4] total 39 [2022-11-19 06:49:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520159509] [2022-11-19 06:49:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-19 06:49:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-19 06:49:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2022-11-19 06:49:19,716 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 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:49:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:20,483 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-11-19 06:49:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-19 06:49:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 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:49:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:20,485 INFO L225 Difference]: With dead ends: 121 [2022-11-19 06:49:20,485 INFO L226 Difference]: Without dead ends: 104 [2022-11-19 06:49:20,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 150 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 06:49:20,487 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 57 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:20,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 302 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 185 Invalid, 0 Unknown, 598 Unchecked, 0.4s Time] [2022-11-19 06:49:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-19 06:49:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2022-11-19 06:49:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 66 states have internal predecessors, (70), 25 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:49:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2022-11-19 06:49:20,509 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 66 [2022-11-19 06:49:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:20,510 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2022-11-19 06:49:20,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 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:49:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2022-11-19 06:49:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:49:20,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:20,511 INFO L195 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:49:20,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 06:49:20,717 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:49:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -879376380, now seen corresponding path program 1 times [2022-11-19 06:49:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545125014] [2022-11-19 06:49:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-19 06:49:20,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:20,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545125014] [2022-11-19 06:49:20,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545125014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:20,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:49:20,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:49:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838282009] [2022-11-19 06:49:20,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:20,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:49:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:20,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:49:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:49:20,823 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-19 06:49:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:20,862 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2022-11-19 06:49:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:49:20,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 68 [2022-11-19 06:49:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:20,864 INFO L225 Difference]: With dead ends: 119 [2022-11-19 06:49:20,864 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 06:49:20,864 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:49:20,865 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 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:49:20,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:49:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 06:49:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-19 06:49:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-19 06:49:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2022-11-19 06:49:20,883 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 68 [2022-11-19 06:49:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:20,883 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2022-11-19 06:49:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-19 06:49:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2022-11-19 06:49:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:49:20,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:20,885 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:49:20,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 06:49:20,886 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 06:49:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1438476175, now seen corresponding path program 1 times [2022-11-19 06:49:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:20,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890899789] [2022-11-19 06:49:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:21,007 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:49:21,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890899789] [2022-11-19 06:49:21,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890899789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998869238] [2022-11-19 06:49:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:21,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:21,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:21,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 06:49:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:21,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:49:21,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:21,154 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:49:21,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:21,227 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:49:21,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998869238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:49:21,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812502330] [2022-11-19 06:49:21,233 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:49:21,233 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:21,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:21,235 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:21,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:21,441 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:49:21,448 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:49:21,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,479 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:49:21,479 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:49:21,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,636 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:49:21,637 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:49:21,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,848 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:49:21,848 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:49:21,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:21,935 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:49:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,772 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:49:22,772 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:49:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:22,997 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:49:22,998 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:49:23,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:23,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:23,052 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:49:23,052 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:49:23,103 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:49:23,114 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:49:23,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:23,236 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:49:25,709 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:49:25,711 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 171 for LOIs [2022-11-19 06:49:25,818 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:49:25,921 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:49:26,023 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:49:41,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1812502330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:49:41,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:49:41,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-11-19 06:49:41,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592675219] [2022-11-19 06:49:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:49:41,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:49:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:49:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:49:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1461, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:49:41,092 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:49:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:49:41,727 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2022-11-19 06:49:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-19 06:49:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:49:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:49:41,728 INFO L225 Difference]: With dead ends: 119 [2022-11-19 06:49:41,729 INFO L226 Difference]: Without dead ends: 118 [2022-11-19 06:49:41,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:49:41,730 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 19 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:49:41,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 382 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 196 Unchecked, 0.2s Time] [2022-11-19 06:49:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-19 06:49:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2022-11-19 06:49:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 79 states have internal predecessors, (82), 27 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-19 06:49:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2022-11-19 06:49:41,758 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 67 [2022-11-19 06:49:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:49:41,759 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2022-11-19 06:49:41,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:49:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-11-19 06:49:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 06:49:41,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:49:41,760 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:49:41,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 06:49:41,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 06:49:41,965 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:49:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:49:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 149433891, now seen corresponding path program 1 times [2022-11-19 06:49:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:49:41,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886803] [2022-11-19 06:49:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:49:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:42,105 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:49:42,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:49:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886803] [2022-11-19 06:49:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:49:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480603764] [2022-11-19 06:49:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:49:42,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:49:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:49:42,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:49:42,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 06:49:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:49:42,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:49:42,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:49:42,261 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:49:42,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:49:42,323 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:49:42,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480603764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:49:42,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520133828] [2022-11-19 06:49:42,331 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-19 06:49:42,331 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:49:42,332 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:49:42,332 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:49:42,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:49:42,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:42,676 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:49:42,676 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:49:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:42,891 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:49:42,891 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:49:42,920 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:49:42,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:42,937 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:49:42,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:49:43,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,030 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:49:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,959 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:49:43,960 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:49:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:44,217 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:49:44,217 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:49:44,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:44,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:44,272 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:49:44,272 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:49:44,323 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:49:44,339 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:49:44,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:49:44,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-11-19 06:49:46,866 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:49:46,867 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 06:49:46,970 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:49:47,077 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:49:47,178 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:03,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1520133828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:03,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:50:03,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-11-19 06:50:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044340007] [2022-11-19 06:50:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:03,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:50:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:50:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:50:03,470 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:50:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:03,580 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2022-11-19 06:50:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:50:03,581 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:50:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:03,582 INFO L225 Difference]: With dead ends: 164 [2022-11-19 06:50:03,582 INFO L226 Difference]: Without dead ends: 163 [2022-11-19 06:50:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:50:03,584 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:03,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 437 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 243 Unchecked, 0.1s Time] [2022-11-19 06:50:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-19 06:50:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2022-11-19 06:50:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 102 states have (on average 1.0784313725490196) internal successors, (110), 106 states have internal predecessors, (110), 36 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-19 06:50:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2022-11-19 06:50:03,633 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 67 [2022-11-19 06:50:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:03,633 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2022-11-19 06:50:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 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:50:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2022-11-19 06:50:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:50:03,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:03,635 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:50:03,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:03,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:03,841 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:50:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1643088305, now seen corresponding path program 1 times [2022-11-19 06:50:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:03,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311891087] [2022-11-19 06:50:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:03,954 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:50:03,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311891087] [2022-11-19 06:50:03,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311891087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:03,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923504894] [2022-11-19 06:50:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:03,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:03,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 06:50:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:04,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:50:04,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:04,110 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:50:04,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:04,178 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:50:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923504894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:50:04,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546285106] [2022-11-19 06:50:04,184 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:50:04,185 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:04,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:04,186 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:04,187 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:04,413 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:50:04,414 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:50:04,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:04,566 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:50:04,566 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:50:04,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:04,778 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:50:04,779 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:50:04,810 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:50:04,822 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:50:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:04,893 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:50:05,640 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:50:05,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-19 06:50:05,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,691 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:50:05,692 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:50:05,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,756 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:50:05,756 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:50:05,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:05,916 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:50:05,917 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:50:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:06,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:06,111 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:50:06,112 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:50:07,027 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:50:07,029 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 65 for LOIs [2022-11-19 06:50:07,043 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 06:50:07,106 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:50:07,203 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:15,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [546285106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:15,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:50:15,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-11-19 06:50:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867066293] [2022-11-19 06:50:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:15,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:50:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:15,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:50:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:50:15,991 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 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 06:50:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:17,587 INFO L93 Difference]: Finished difference Result 166 states and 189 transitions. [2022-11-19 06:50:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-19 06:50:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 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 06:50:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:17,588 INFO L225 Difference]: With dead ends: 166 [2022-11-19 06:50:17,589 INFO L226 Difference]: Without dead ends: 118 [2022-11-19 06:50:17,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=227, Invalid=1665, Unknown=0, NotChecked=0, Total=1892 [2022-11-19 06:50:17,590 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:17,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 323 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 602 Invalid, 0 Unknown, 200 Unchecked, 0.8s Time] [2022-11-19 06:50:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-19 06:50:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-19 06:50:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.077922077922078) internal successors, (83), 79 states have internal predecessors, (83), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-19 06:50:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2022-11-19 06:50:17,619 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 68 [2022-11-19 06:50:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:17,619 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2022-11-19 06:50:17,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 1.44) internal successors, (36), 30 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 06:50:17,620 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-11-19 06:50:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-19 06:50:17,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:17,621 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:50:17,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:17,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:17,827 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:50:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 337483485, now seen corresponding path program 1 times [2022-11-19 06:50:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583350616] [2022-11-19 06:50:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:17,932 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:50:17,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583350616] [2022-11-19 06:50:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583350616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821018904] [2022-11-19 06:50:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:17,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:17,935 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:17,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 06:50:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:18,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:50:18,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:18,091 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:50:18,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:18,164 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:50:18,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821018904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:50:18,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1661512157] [2022-11-19 06:50:18,167 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:50:18,168 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:18,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:18,168 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:18,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:18,351 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:50:18,359 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:50:18,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:18,500 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-19 06:50: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:50:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:18,554 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-19 06:50:18,555 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:50:18,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:18,740 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:50:18,741 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:50:18,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:18,843 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:50:19,642 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:50:19,650 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:50:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,694 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:50:19,694 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:50:19,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,913 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:50:19,914 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:50:19,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:19,963 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:50:19,963 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:50:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:20,123 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:50:22,464 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:50:22,466 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-11-19 06:50:22,568 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-19 06:50:22,666 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-19 06:50:22,785 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:38,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1661512157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:38,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:50:38,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-11-19 06:50:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437996360] [2022-11-19 06:50:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:38,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-19 06:50:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-19 06:50:38,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:50:38,928 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 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 06:50:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:39,162 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-11-19 06:50:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-19 06:50:39,162 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 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 06:50:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:39,163 INFO L225 Difference]: With dead ends: 145 [2022-11-19 06:50:39,163 INFO L226 Difference]: Without dead ends: 121 [2022-11-19 06:50:39,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-11-19 06:50:39,165 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:39,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 382 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 393 Unchecked, 0.2s Time] [2022-11-19 06:50:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-19 06:50:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-11-19 06:50:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 78 states have internal predecessors, (81), 25 states have call successors, (25), 15 states have call predecessors, (25), 15 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-19 06:50:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2022-11-19 06:50:39,200 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 68 [2022-11-19 06:50:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:39,200 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2022-11-19 06:50:39,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 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 06:50:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-11-19 06:50:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 06:50:39,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:39,202 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 06:50:39,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 06:50:39,412 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:50:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -424038214, now seen corresponding path program 1 times [2022-11-19 06:50:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65207213] [2022-11-19 06:50:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:39,518 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:50:39,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:39,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65207213] [2022-11-19 06:50:39,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65207213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:39,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424400979] [2022-11-19 06:50:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:39,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:39,520 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:39,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 06:50:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:39,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:50:39,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:39,687 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:50:39,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:39,767 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:50:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424400979] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:50:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764997118] [2022-11-19 06:50:39,772 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 06:50:39,772 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:39,773 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:39,773 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:39,773 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:39,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,119 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:50:40,120 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:50:40,150 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:50:40,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,161 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:50:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,180 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:50:40,202 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:50:40,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:40,257 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:50:41,017 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:50:41,026 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:50:41,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,063 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:50:41,063 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:50:41,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:50:41,114 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:50:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,261 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-19 06:50:41,262 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:50:41,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:41,471 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:50:41,472 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:50:42,387 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:50:42,389 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 60 for LOIs [2022-11-19 06:50:42,395 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-11-19 06:50:42,455 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-19 06:50:42,468 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:50:50,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [764997118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:50:50,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:50:50,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-11-19 06:50:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622508823] [2022-11-19 06:50:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:50:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 06:50:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:50:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 06:50:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2022-11-19 06:50:50,773 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 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 06:50:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:50:52,863 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-11-19 06:50:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 06:50:52,864 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 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 06:50:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:50:52,865 INFO L225 Difference]: With dead ends: 121 [2022-11-19 06:50:52,865 INFO L226 Difference]: Without dead ends: 63 [2022-11-19 06:50:52,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 06:50:52,867 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 71 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:50:52,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 159 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 731 Invalid, 0 Unknown, 314 Unchecked, 1.1s Time] [2022-11-19 06:50:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-19 06:50:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-19 06:50:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.0) internal successors, (40), 40 states have internal predecessors, (40), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 06:50:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-19 06:50:52,890 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 69 [2022-11-19 06:50:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:50:52,890 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-19 06:50:52,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 31 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 06:50:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-19 06:50:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 06:50:52,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:50:52,892 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:50:52,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 06:50:53,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 06:50:53,100 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-19 06:50:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:50:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash 910503978, now seen corresponding path program 1 times [2022-11-19 06:50:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:50:53,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209760866] [2022-11-19 06:50:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:50:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-19 06:50:53,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:50:53,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209760866] [2022-11-19 06:50:53,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209760866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:50:53,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891592784] [2022-11-19 06:50:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:50:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:50:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:50:53,205 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:50:53,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 06:50:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:50:53,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:50:53,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:50:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-19 06:50:53,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:50:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-19 06:50:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891592784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:50:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61334999] [2022-11-19 06:50:53,449 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 06:50:53,450 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:50:53,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:50:53,450 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:50:53,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:50:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:53,827 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-19 06:50:53,827 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:50:53,851 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:50:53,861 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:50:53,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:53,875 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:50:53,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:53,897 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:50:54,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,063 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:50:54,862 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:50:54,871 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:50:54,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,920 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-19 06:50:54,921 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:50:54,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:54,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:55,202 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-19 06:50:55,203 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:50:55,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:55,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:55,256 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 06:50:55,257 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:50:55,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:50:55,469 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-19 06:50:55,469 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 146 treesize of output 194 [2022-11-19 06:51:08,352 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-19 06:51:08,354 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 58 for LOIs [2022-11-19 06:51:08,361 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-19 06:51:08,363 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 35 for LOIs [2022-11-19 06:51:08,367 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:51:27,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [61334999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:51:27,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:51:27,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 38 [2022-11-19 06:51:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085796018] [2022-11-19 06:51:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:51:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 06:51:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:51:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 06:51:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 06:51:27,202 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 32 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 06:51:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:51:27,442 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-19 06:51:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-19 06:51:27,443 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 70 [2022-11-19 06:51:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:51:27,444 INFO L225 Difference]: With dead ends: 63 [2022-11-19 06:51:27,444 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:51:27,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 162 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2022-11-19 06:51:27,445 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:51:27,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 189 Unchecked, 0.2s Time] [2022-11-19 06:51:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:51:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:51:27,446 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 06:51:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:51:27,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2022-11-19 06:51:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:51:27,446 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:51:27,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 27 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-19 06:51:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:51:27,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:51:27,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-19 06:51:27,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-19 06:51:27,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-19 06:51:27,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-19 06:51:27,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-19 06:51:27,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-19 06:51:27,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-19 06:51:27,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-19 06:51:27,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 06:51:27,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-19 06:51:27,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:51:50,795 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-19 06:51:50,795 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-19 06:51:50,803 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-19 06:51:50,803 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-19 06:51:50,804 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-19 06:51:50,804 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-19 06:51:50,804 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-19 06:51:50,804 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-19 06:51:50,805 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-19 06:51:50,805 INFO L902 garLoopResultBuilder]: At program point L1662-1(line 1662) the Hoare annotation is: true [2022-11-19 06:51:50,805 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-19 06:51:50,805 INFO L902 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: true [2022-11-19 06:51:50,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-19 06:51:50,806 INFO L895 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: (let ((.cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse56 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647)) (.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)) (.cse44 (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|)) (.cse57 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.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 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse53 (= |#NULL.base| 0)) (.cse54 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse44) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse55 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse56 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse1 .cse10 .cse55 .cse11 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse57 .cse21 .cse56 .cse30 .cse34 .cse37 .cse38 .cse40 .cse42 .cse43 .cse47 (<= 0 |#StackHeapBarrier|) .cse48 .cse50 .cse53 .cse54) (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|) .cse44) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse57 .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| 1)) .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54))) [2022-11-19 06:51:50,807 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-11-19 06:51:50,807 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-11-19 06:51:50,807 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2022-11-19 06:51:50,807 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2022-11-19 06:51:50,808 INFO L895 garLoopResultBuilder]: At program point L1638-4(lines 1638 1641) the Hoare annotation is: (let ((.cse55 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse57 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647)) (.cse38 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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)) (.cse44 (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|)) (.cse56 (<= |ULTIMATE.start_goodB2G1_~result~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 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse53 (= |#NULL.base| 0)) (.cse54 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse44) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse1 .cse10 .cse55 .cse11 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse56 .cse57 .cse29 .cse33 .cse36 .cse37 .cse39 .cse41 .cse42 .cse43 .cse47 (<= 0 |#StackHeapBarrier|) .cse48 .cse50 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse55 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse57 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (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|) .cse44) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse56 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54))) [2022-11-19 06:51:50,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 06:51:50,809 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (store ((as const (Array Int Int)) 0) 0 0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 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 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse52 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.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)) (.cse53 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse46 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse54 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse31 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647)) (.cse32 (= ~globalArgv~0.base 0)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse55 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (= ~globalArgc~0 0)) (.cse42 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= 5 ~globalFive~0)) (.cse47 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse53 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .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 .cse51) (and .cse0 .cse1 .cse2 .cse3 .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))) .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse54 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse52 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse37 .cse38 .cse39 .cse55 .cse53 .cse41 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse2 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse18 .cse54 .cse31 .cse32 .cse38 .cse39 .cse55 .cse41 .cse42 .cse45 (<= 0 |#StackHeapBarrier|) .cse47 .cse50 .cse51))) [2022-11-19 06:51:50,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:51:50,810 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) 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 (= (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 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse11 (= (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))) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse13 (= ~globalArgv~0.offset 0)) (.cse14 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= 21 (select |#length| 4))) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (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| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (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 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse23 .cse24 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse37 .cse38 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse39 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-19 06:51:50,810 INFO L899 garLoopResultBuilder]: For program point L1597-1(lines 1591 1598) no Hoare annotation was computed. [2022-11-19 06:51:50,810 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:51:50,810 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1633) no Hoare annotation was computed. [2022-11-19 06:51:50,811 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= ~globalArgv~0.offset 0)) (.cse2 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse3 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse4 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse5 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646)) (.cse6 (= ~globalArgv~0.base 0)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (= ~globalFalse~0 0)) (.cse9 (= ~globalArgc~0 0)) (.cse10 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse11 (= 5 ~globalFive~0)) (.cse12 (= |#NULL.base| 0)) (.cse13 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse4 .cse5 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse6 .cse7 .cse8 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse9 .cse10 .cse11 (<= 0 |#StackHeapBarrier|) .cse12 .cse13) (and (= (select |#length| 9) 21) .cse0 (= (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) .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= (store ((as const (Array Int Int)) 0) 0 0) (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)))) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) .cse4 (= |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|) .cse5 (<= |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|) .cse6 (= |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) .cse7 .cse8 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse9 .cse10 (= (select |#valid| 6) 1) (= (select |#length| 8) 54) .cse11 (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) .cse12 .cse13))) [2022-11-19 06:51:50,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-19 06:51:50,812 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-19 06:51:50,812 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-19 06:51:50,812 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-19 06:51:50,812 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-19 06:51:50,813 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1598) no Hoare annotation was computed. [2022-11-19 06:51:50,813 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1613) no Hoare annotation was computed. [2022-11-19 06:51:50,814 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) 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) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (= ~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) (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) (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#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 06:51:50,815 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-11-19 06:51:50,815 INFO L899 garLoopResultBuilder]: For program point L1642-1(lines 1642 1648) no Hoare annotation was computed. [2022-11-19 06:51:50,815 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1649) no Hoare annotation was computed. [2022-11-19 06:51:50,815 INFO L899 garLoopResultBuilder]: For program point L1601(line 1601) no Hoare annotation was computed. [2022-11-19 06:51:50,815 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-19 06:51:50,815 INFO L899 garLoopResultBuilder]: For program point L1601-1(lines 1601 1612) no Hoare annotation was computed. [2022-11-19 06:51:50,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-19 06:51:50,816 INFO L899 garLoopResultBuilder]: For program point L1626(line 1626) no Hoare annotation was computed. [2022-11-19 06:51:50,816 INFO L899 garLoopResultBuilder]: For program point L1626-1(lines 1626 1632) no Hoare annotation was computed. [2022-11-19 06:51:50,817 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse21 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse50 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse51 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (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|) .cse12) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse1 .cse4 .cse11 .cse50 .cse13 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse17 .cse21 .cse51 .cse31 .cse37 .cse38 .cse39 .cse41 .cse52 .cse44 (<= 0 |#StackHeapBarrier|) .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse50 .cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse51 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse54 .cse41 .cse52 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse54 .cse40 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse12) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-11-19 06:51:50,817 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-19 06:51:50,818 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:51:50,818 INFO L899 garLoopResultBuilder]: For program point L1618-2(lines 1618 1625) no Hoare annotation was computed. [2022-11-19 06:51:50,818 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-19 06:51:50,819 INFO L895 garLoopResultBuilder]: At program point L1618-3(lines 1618 1625) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse7 (<= |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647)) (.cse13 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse6 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse11 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.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)) (.cse2 (= ~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)) (.cse5 (= ~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|)) (.cse33 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse34 (= 16 (select |#length| 7))) (.cse35 (= (select |#length| 5) 54)) (.cse36 (= (select |#valid| 4) 1)) (.cse37 (= 16 (select |#length| 3))) (.cse38 (= (select |#length| 2) 1)) (.cse39 (= (select |#valid| 1) 1)) (.cse40 (= 16 (select |#length| 11))) (.cse41 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse8 (= ~globalArgv~0.base 0)) (.cse42 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse43 (= (select (select |#memory_int| 6) 0) 0)) (.cse44 (= (select |#valid| 0) 0)) (.cse45 (= (select |#length| 1) 1)) (.cse46 (= (select |#valid| 2) 1)) (.cse9 (= |#NULL.offset| 0)) (.cse10 (= ~globalFalse~0 0)) (.cse47 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse54 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse12 (= ~globalArgc~0 0)) (.cse26 (store ((as const (Array Int Int)) 0) 0 0)) (.cse48 (= (select |#valid| 6) 1)) (.cse49 (= (select |#length| 8) 54)) (.cse14 (= 5 ~globalFive~0)) (.cse50 (= (select |#valid| 10) 1)) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0)) (.cse16 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 |#StackHeapBarrier|) .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse2 .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 .cse5 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse7 .cse8 .cse42 .cse43 .cse44 .cse45 .cse46 .cse9 .cse10 .cse47 .cse12 .cse13 .cse48 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse2 (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 .cse30 .cse31 .cse32 .cse6 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse53 .cse8 .cse42 .cse43 .cse44 .cse45 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse46 .cse9 .cse10 .cse11 .cse54 .cse12 .cse48 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse2 .cse4 .cse27 .cse28 .cse29 .cse5 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse53 .cse8 .cse42 .cse43 .cse44 .cse45 .cse46 .cse9 .cse10 .cse47 .cse54 .cse12 (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)))) .cse48 .cse49 .cse14 .cse50 .cse51 .cse52 .cse15 .cse16))) [2022-11-19 06:51:50,819 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-19 06:51:50,820 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 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 06:51:50,820 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) 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)) (.cse38 (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 (= 16 (select |#length| 7))) (.cse20 (= (select |#length| 5) 54)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.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)) (.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 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .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 (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|) .cse38) (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)))) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (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|) .cse38) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_10|) 14))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse33 .cse34 .cse35 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 06:51:50,821 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:51:50,821 INFO L895 garLoopResultBuilder]: At program point L1660(line 1660) 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 06:51:50,821 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-19 06:51:50,821 INFO L899 garLoopResultBuilder]: For program point L1660-1(line 1660) no Hoare annotation was computed. [2022-11-19 06:51:50,822 INFO L899 garLoopResultBuilder]: For program point L1603(lines 1603 1611) no Hoare annotation was computed. [2022-11-19 06:51:50,822 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-19 06:51:50,822 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-19 06:51:50,822 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-19 06:51:50,823 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: false [2022-11-19 06:51:50,829 INFO L895 garLoopResultBuilder]: At program point L1587(line 1587) 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 (= 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)) (.cse28 (store ((as const (Array Int Int)) 0) 0 0)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~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 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse28 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (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))) .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45))) [2022-11-19 06:51:50,829 INFO L899 garLoopResultBuilder]: For program point L1587-1(line 1587) no Hoare annotation was computed. [2022-11-19 06:51:50,830 INFO L899 garLoopResultBuilder]: For program point L1587-2(lines 1587 1600) no Hoare annotation was computed. [2022-11-19 06:51:50,830 INFO L895 garLoopResultBuilder]: At program point L1587-4(lines 1587 1600) 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 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse11 (store ((as const (Array Int Int)) 0) 0 0)) (.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))) (.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 (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 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse33 .cse34 .cse35 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse11) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-19 06:51:50,830 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-19 06:51:50,831 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-11-19 06:51:50,831 INFO L895 garLoopResultBuilder]: At program point L1579(line 1579) 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 06:51:50,833 INFO L899 garLoopResultBuilder]: For program point L1579-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-19 06:51:50,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-19 06:51:50,834 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-19 06:51:50,834 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-19 06:51:50,837 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:51:50,839 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:51:50,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:51:50 BoogieIcfgContainer [2022-11-19 06:51:50,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:51:50,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:51:50,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:51:50,851 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:51:50,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:25" (3/4) ... [2022-11-19 06:51:50,854 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:51:50,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-19 06:51:50,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-19 06:51:50,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-19 06:51:50,860 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-19 06:51:50,867 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-19 06:51:50,867 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-19 06:51:50,868 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 06:51:50,868 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:51:50,868 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:51:50,930 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:51:50,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:51:50,931 INFO L158 Benchmark]: Toolchain (without parser) took 207526.71ms. Allocated memory was 102.8MB in the beginning and 648.0MB in the end (delta: 545.3MB). Free memory was 56.1MB in the beginning and 503.5MB in the end (delta: -447.5MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,931 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 102.8MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:51:50,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1239.26ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 55.9MB in the beginning and 95.2MB in the end (delta: -39.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.92ms. Allocated memory is still 144.7MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,940 INFO L158 Benchmark]: Boogie Preprocessor took 57.87ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,942 INFO L158 Benchmark]: RCFGBuilder took 615.41ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 70.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,942 INFO L158 Benchmark]: TraceAbstraction took 205419.06ms. Allocated memory was 144.7MB in the beginning and 648.0MB in the end (delta: 503.3MB). Free memory was 69.1MB in the beginning and 507.7MB in the end (delta: -438.6MB). Peak memory consumption was 354.9MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,943 INFO L158 Benchmark]: Witness Printer took 80.08ms. Allocated memory is still 648.0MB. Free memory was 507.7MB in the beginning and 503.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 06:51:50,945 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.24ms. Allocated memory is still 102.8MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1239.26ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 55.9MB in the beginning and 95.2MB in the end (delta: -39.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.92ms. Allocated memory is still 144.7MB. Free memory was 95.2MB in the beginning and 92.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.87ms. Allocated memory is still 144.7MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.41ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 70.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 205419.06ms. Allocated memory was 144.7MB in the beginning and 648.0MB in the end (delta: 503.3MB). Free memory was 69.1MB in the beginning and 507.7MB in the end (delta: -438.6MB). Peak memory consumption was 354.9MB. Max. memory is 16.1GB. * Witness Printer took 80.08ms. Allocated memory is still 648.0MB. Free memory was 507.7MB in the beginning and 503.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: 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: 205.3s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 5148 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2505 IncrementalHoareTripleChecker+Unchecked, 3499 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2311 IncrementalHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 1649 mSDtfsCounter, 2311 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2063 GetRequests, 1651 SyntacticMatches, 53 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 115.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=19, InterpolantAutomatonStates: 333, 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, 23 MinimizatonAttempts, 156 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 140 PreInvPairs, 188 NumberOfFragments, 8549 HoareAnnotationTreeSize, 140 FomulaSimplifications, 4463 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 25 FomulaSimplificationsInter, 27520 FormulaSimplificationTreeSizeReductionInter, 22.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 2062 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2555 ConstructedInterpolants, 0 QuantifiedInterpolants, 3113 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4256 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 47 InterpolantComputations, 15 PerfectInterpolantSequences, 1269/1310 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: 52.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 40, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 475, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 313, TOOLS_POST_TIME: 20.0s, TOOLS_POST_CALL_APPLICATIONS: 291, TOOLS_POST_CALL_TIME: 16.9s, TOOLS_POST_RETURN_APPLICATIONS: 194, TOOLS_POST_RETURN_TIME: 9.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 798, TOOLS_QUANTIFIERELIM_TIME: 45.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1126, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 259, DOMAIN_JOIN_TIME: 4.4s, 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: 475, 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: 194, CALL_SUMMARIZER_CACHE_MISSES: 32, 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: 15517, DAG_COMPRESSION_RETAINED_NODES: 1150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1662]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-19 06:51:50,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3b3b4df-0431-4426-9760-bef8b4bdebcb/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