./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 --- 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-2329fc7 [2022-12-13 16:22:12,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:22:12,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:22:12,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:22:12,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:22:12,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:22:12,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:22:12,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:22:12,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:22:12,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:22:12,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:22:12,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:22:12,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:22:12,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:22:12,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:22:12,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:22:12,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:22:12,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:22:12,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:22:12,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:22:12,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:22:12,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:22:12,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:22:12,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:22:12,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:22:12,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:22:12,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:22:12,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:22:12,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:22:12,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:22:12,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:22:12,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:22:12,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:22:12,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:22:12,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:22:12,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:22:12,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:22:12,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:22:12,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:22:12,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:22:12,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:22:12,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 16:22:12,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:22:12,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:22:12,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:22:12,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:22:12,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:22:12,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:22:12,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:22:12,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:22:12,638 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:22:12,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 16:22:12,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:22:12,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:22:12,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:22:12,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:22:12,641 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/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_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 [2022-12-13 16:22:12,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:22:12,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:22:12,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:22:12,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:22:12,863 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:22:12,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-12-13 16:22:15,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:22:15,595 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:22:15,595 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-12-13 16:22:15,604 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/data/8e13b5564/f1f6e68e49b4470885af305d8aa0dd6b/FLAG108edd4a7 [2022-12-13 16:22:15,967 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/data/8e13b5564/f1f6e68e49b4470885af305d8aa0dd6b [2022-12-13 16:22:15,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:22:15,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:22:15,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:22:15,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:22:15,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:22:15,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:22:15" (1/1) ... [2022-12-13 16:22:15,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59de40ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:15, skipping insertion in model container [2022-12-13 16:22:15,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:22:15" (1/1) ... [2022-12-13 16:22:15,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:22:16,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:22:16,156 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-12-13 16:22:16,167 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,172 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,176 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,180 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,182 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,182 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,183 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,187 WARN L623 FunctionHandler]: Unknown extern function smp_get_num [2022-12-13 16:22:16,190 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,192 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,192 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,193 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,199 WARN L623 FunctionHandler]: Unknown extern function smp_get_llnum [2022-12-13 16:22:16,205 WARN L623 FunctionHandler]: Unknown extern function smp_send_req [2022-12-13 16:22:16,206 WARN L623 FunctionHandler]: Unknown extern function smp_get_func_def_resp_len [2022-12-13 16:22:16,207 WARN L623 FunctionHandler]: Unknown extern function dStrHex [2022-12-13 16:22:16,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:22:16,221 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:22:16,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-12-13 16:22:16,239 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,241 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,245 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 16:22:16,249 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,251 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,252 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,252 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,256 WARN L623 FunctionHandler]: Unknown extern function smp_get_num [2022-12-13 16:22:16,259 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,260 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,261 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,261 WARN L623 FunctionHandler]: Unknown extern function toupper [2022-12-13 16:22:16,267 WARN L623 FunctionHandler]: Unknown extern function smp_get_llnum [2022-12-13 16:22:16,273 WARN L623 FunctionHandler]: Unknown extern function smp_send_req [2022-12-13 16:22:16,275 WARN L623 FunctionHandler]: Unknown extern function smp_get_func_def_resp_len [2022-12-13 16:22:16,276 WARN L623 FunctionHandler]: Unknown extern function dStrHex [2022-12-13 16:22:16,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:22:16,293 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:22:16,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16 WrapperNode [2022-12-13 16:22:16,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:22:16,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:22:16,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:22:16,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:22:16,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,360 INFO L138 Inliner]: procedures = 36, calls = 639, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 546 [2022-12-13 16:22:16,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:22:16,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:22:16,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:22:16,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:22:16,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:22:16,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:22:16,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:22:16,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:22:16,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (1/1) ... [2022-12-13 16:22:16,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:22:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:16,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:22:16,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:22:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 16:22:16,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 16:22:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:22:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:22:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:22:16,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:22:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 16:22:16,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 16:22:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:22:16,561 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:22:16,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:22:17,047 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:22:17,054 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:22:17,054 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:22:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:22:17 BoogieIcfgContainer [2022-12-13 16:22:17,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:22:17,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:22:17,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:22:17,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:22:17,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:22:15" (1/3) ... [2022-12-13 16:22:17,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794d7bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:22:17, skipping insertion in model container [2022-12-13 16:22:17,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:22:16" (2/3) ... [2022-12-13 16:22:17,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794d7bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:22:17, skipping insertion in model container [2022-12-13 16:22:17,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:22:17" (3/3) ... [2022-12-13 16:22:17,064 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2022-12-13 16:22:17,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:22:17,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-12-13 16:22:17,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:22:17,136 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=PETRI_NET, 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;@159f9faf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:22:17,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-12-13 16:22:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 102 states have (on average 1.7549019607843137) internal successors, (179), 144 states have internal predecessors, (179), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 16:22:17,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:17,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 16:22:17,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 37800, now seen corresponding path program 1 times [2022-12-13 16:22:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:17,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742839398] [2022-12-13 16:22:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:17,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742839398] [2022-12-13 16:22:17,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742839398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:17,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:17,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:22:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321490959] [2022-12-13 16:22:17,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:17,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:22:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:22:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:22:17,478 INFO L87 Difference]: Start difference. First operand has 155 states, 102 states have (on average 1.7549019607843137) internal successors, (179), 144 states have internal predecessors, (179), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-12-13 16:22:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:17,518 INFO L93 Difference]: Finished difference Result 282 states and 354 transitions. [2022-12-13 16:22:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:22:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2022-12-13 16:22:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:17,525 INFO L225 Difference]: With dead ends: 282 [2022-12-13 16:22:17,526 INFO L226 Difference]: Without dead ends: 137 [2022-12-13 16:22:17,528 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-12-13 16:22:17,530 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 162 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:17,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:22:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-13 16:22:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-12-13 16:22:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 126 states have internal predecessors, (145), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2022-12-13 16:22:17,562 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 3 [2022-12-13 16:22:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:17,563 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2022-12-13 16:22:17,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-12-13 16:22:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2022-12-13 16:22:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:22:17,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:17,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:17,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:22:17,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash -434459748, now seen corresponding path program 1 times [2022-12-13 16:22:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:17,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600148978] [2022-12-13 16:22:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:17,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:17,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600148978] [2022-12-13 16:22:17,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600148978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:17,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:17,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:22:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636030270] [2022-12-13 16:22:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:17,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:22:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:22:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:22:17,676 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:17,801 INFO L93 Difference]: Finished difference Result 390 states and 466 transitions. [2022-12-13 16:22:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:22:17,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-12-13 16:22:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:17,805 INFO L225 Difference]: With dead ends: 390 [2022-12-13 16:22:17,805 INFO L226 Difference]: Without dead ends: 262 [2022-12-13 16:22:17,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-13 16:22:17,806 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 134 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:17,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 516 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-12-13 16:22:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 139. [2022-12-13 16:22:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 128 states have internal predecessors, (147), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2022-12-13 16:22:17,819 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 25 [2022-12-13 16:22:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:17,819 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2022-12-13 16:22:17,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2022-12-13 16:22:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:22:17,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:17,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:17,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:22:17,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2022807650, now seen corresponding path program 1 times [2022-12-13 16:22:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:17,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033567084] [2022-12-13 16:22:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:17,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033567084] [2022-12-13 16:22:17,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033567084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:17,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:17,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:22:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135333848] [2022-12-13 16:22:17,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:17,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:22:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:22:17,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:22:17,938 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:18,040 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2022-12-13 16:22:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:22:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-12-13 16:22:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:18,042 INFO L225 Difference]: With dead ends: 142 [2022-12-13 16:22:18,042 INFO L226 Difference]: Without dead ends: 140 [2022-12-13 16:22:18,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:22:18,045 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 224 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:18,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 285 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-13 16:22:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-12-13 16:22:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 126 states have internal predecessors, (145), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2022-12-13 16:22:18,054 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 25 [2022-12-13 16:22:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:18,055 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2022-12-13 16:22:18,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2022-12-13 16:22:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 16:22:18,055 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:18,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:18,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:22:18,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1717472426, now seen corresponding path program 1 times [2022-12-13 16:22:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:18,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830936168] [2022-12-13 16:22:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:18,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830936168] [2022-12-13 16:22:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830936168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:18,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:22:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472480805] [2022-12-13 16:22:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:22:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:22:18,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:22:18,195 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:18,291 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2022-12-13 16:22:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:22:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-12-13 16:22:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:18,292 INFO L225 Difference]: With dead ends: 147 [2022-12-13 16:22:18,292 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 16:22:18,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:22:18,294 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 27 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:18,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 384 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 16:22:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2022-12-13 16:22:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 131 states have internal predecessors, (151), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2022-12-13 16:22:18,304 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 26 [2022-12-13 16:22:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:18,304 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2022-12-13 16:22:18,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-12-13 16:22:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 16:22:18,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:18,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:18,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:22:18,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1717532008, now seen corresponding path program 1 times [2022-12-13 16:22:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:18,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456276667] [2022-12-13 16:22:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456276667] [2022-12-13 16:22:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456276667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:18,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:18,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:22:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113381662] [2022-12-13 16:22:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:22:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:18,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:22:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:22:18,405 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:18,500 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2022-12-13 16:22:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:22:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-12-13 16:22:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:18,502 INFO L225 Difference]: With dead ends: 151 [2022-12-13 16:22:18,502 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 16:22:18,503 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-12-13 16:22:18,504 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 17 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:18,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 387 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 16:22:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2022-12-13 16:22:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 95 states have (on average 1.568421052631579) internal successors, (149), 130 states have internal predecessors, (149), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2022-12-13 16:22:18,515 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 26 [2022-12-13 16:22:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:18,515 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2022-12-13 16:22:18,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2022-12-13 16:22:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 16:22:18,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:18,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:18,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:22:18,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1668476983, now seen corresponding path program 1 times [2022-12-13 16:22:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:18,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108911863] [2022-12-13 16:22:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:18,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108911863] [2022-12-13 16:22:18,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108911863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:22:18,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:22:18,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:22:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584305488] [2022-12-13 16:22:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:22:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:22:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:18,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:22:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:22:18,780 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:18,881 INFO L93 Difference]: Finished difference Result 270 states and 317 transitions. [2022-12-13 16:22:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:22:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-12-13 16:22:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:18,882 INFO L225 Difference]: With dead ends: 270 [2022-12-13 16:22:18,883 INFO L226 Difference]: Without dead ends: 142 [2022-12-13 16:22:18,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:22:18,885 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 8 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:18,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 563 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-12-13 16:22:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-12-13 16:22:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5625) internal successors, (150), 131 states have internal predecessors, (150), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2022-12-13 16:22:18,895 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 31 [2022-12-13 16:22:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:18,895 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2022-12-13 16:22:18,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 16:22:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2022-12-13 16:22:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 16:22:18,896 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:18,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:18,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:22:18,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1515959845, now seen corresponding path program 1 times [2022-12-13 16:22:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:18,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524723480] [2022-12-13 16:22:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:19,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:19,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524723480] [2022-12-13 16:22:19,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524723480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:19,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364680857] [2022-12-13 16:22:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:19,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:19,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:19,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:19,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:22:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:19,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 16:22:19,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:19,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:22:19,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 16:22:19,482 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:22:19,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 16:22:19,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:19,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:19,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:19,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:22:19,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:19,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 16:22:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:19,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:20,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_do_discover_list_~#smp_rr~0#1.base| v_ArrVal_265) |c_~#smp_def_rrlen_arr~0.base|) (+ |c_~#smp_def_rrlen_arr~0.offset| 8)) 536870912)) is different from false [2022-12-13 16:22:20,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364680857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:20,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:22:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 16 [2022-12-13 16:22:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527681397] [2022-12-13 16:22:20,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:20,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 16:22:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 16:22:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=322, Unknown=7, NotChecked=36, Total=420 [2022-12-13 16:22:20,005 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:22:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:20,830 INFO L93 Difference]: Finished difference Result 385 states and 452 transitions. [2022-12-13 16:22:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:22:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-12-13 16:22:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:20,833 INFO L225 Difference]: With dead ends: 385 [2022-12-13 16:22:20,833 INFO L226 Difference]: Without dead ends: 254 [2022-12-13 16:22:20,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=692, Unknown=11, NotChecked=54, Total=870 [2022-12-13 16:22:20,835 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 126 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 22 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:20,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2797 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 652 Invalid, 19 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:22:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-13 16:22:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 145. [2022-12-13 16:22:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 134 states have internal predecessors, (154), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2022-12-13 16:22:20,847 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 32 [2022-12-13 16:22:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:20,847 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2022-12-13 16:22:20,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:22:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2022-12-13 16:22:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 16:22:20,849 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:20,849 INFO L195 NwaCegarLoop]: trace histogram [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-12-13 16:22:20,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:22:21,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:21,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1449253705, now seen corresponding path program 2 times [2022-12-13 16:22:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:21,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580063523] [2022-12-13 16:22:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:21,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:22:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:21,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580063523] [2022-12-13 16:22:21,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580063523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:21,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049697969] [2022-12-13 16:22:21,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:22:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:21,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:21,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:22:21,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:22:21,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:22:21,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 16:22:21,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:21,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:22:21,955 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:22:21,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-12-13 16:22:22,046 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:22:22,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 16:22:22,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:22,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:22,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:22,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:22:22,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 16:22:22,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 16:22:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:22:22,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049697969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:22,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:22:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 17 [2022-12-13 16:22:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340543343] [2022-12-13 16:22:22,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 16:22:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:22,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 16:22:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=391, Unknown=9, NotChecked=0, Total=462 [2022-12-13 16:22:22,545 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:22:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:23,488 INFO L93 Difference]: Finished difference Result 411 states and 486 transitions. [2022-12-13 16:22:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 16:22:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-12-13 16:22:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:23,491 INFO L225 Difference]: With dead ends: 411 [2022-12-13 16:22:23,491 INFO L226 Difference]: Without dead ends: 277 [2022-12-13 16:22:23,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1108, Unknown=19, NotChecked=0, Total=1332 [2022-12-13 16:22:23,493 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 236 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 32 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:23,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 2526 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 756 Invalid, 74 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:22:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-13 16:22:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 156. [2022-12-13 16:22:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 144 states have internal predecessors, (167), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-12-13 16:22:23,502 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 33 [2022-12-13 16:22:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:23,503 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-12-13 16:22:23,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:22:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-12-13 16:22:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 16:22:23,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:23,504 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 16:22:23,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:22:23,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 16:22:23,706 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 386690430, now seen corresponding path program 1 times [2022-12-13 16:22:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:23,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6619761] [2022-12-13 16:22:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6619761] [2022-12-13 16:22:24,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6619761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919211164] [2022-12-13 16:22:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:24,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:24,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:22:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 16:22:24,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:24,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:24,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919211164] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:22:24,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:22:24,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-12-13 16:22:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731811682] [2022-12-13 16:22:24,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:24,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 16:22:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 16:22:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:22:24,775 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:25,233 INFO L93 Difference]: Finished difference Result 315 states and 374 transitions. [2022-12-13 16:22:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 16:22:25,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-12-13 16:22:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:25,235 INFO L225 Difference]: With dead ends: 315 [2022-12-13 16:22:25,235 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 16:22:25,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-12-13 16:22:25,235 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 14 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:25,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1284 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:22:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 16:22:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-12-13 16:22:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 122 states have (on average 1.5163934426229508) internal successors, (185), 157 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2022-12-13 16:22:25,245 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 38 [2022-12-13 16:22:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:25,245 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2022-12-13 16:22:25,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2022-12-13 16:22:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 16:22:25,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:25,246 INFO L195 NwaCegarLoop]: trace histogram [8, 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] [2022-12-13 16:22:25,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:22:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:25,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2038374750, now seen corresponding path program 2 times [2022-12-13 16:22:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641353988] [2022-12-13 16:22:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:25,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:25,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641353988] [2022-12-13 16:22:25,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641353988] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:25,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859120585] [2022-12-13 16:22:25,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:22:25,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:25,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:25,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:25,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:22:26,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:22:26,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:22:26,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 16:22:26,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:26,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:27,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859120585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:22:27,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:22:27,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-12-13 16:22:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656472926] [2022-12-13 16:22:27,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:27,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 16:22:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 16:22:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2022-12-13 16:22:27,387 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:35,200 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2022-12-13 16:22:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 16:22:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-12-13 16:22:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:35,201 INFO L225 Difference]: With dead ends: 357 [2022-12-13 16:22:35,201 INFO L226 Difference]: Without dead ends: 190 [2022-12-13 16:22:35,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=929, Invalid=2262, Unknown=1, NotChecked=0, Total=3192 [2022-12-13 16:22:35,203 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 34 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:35,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1767 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:22:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-12-13 16:22:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-12-13 16:22:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 177 states have internal predecessors, (201), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2022-12-13 16:22:35,222 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 43 [2022-12-13 16:22:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:35,223 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2022-12-13 16:22:35,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 31 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2022-12-13 16:22:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 16:22:35,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:35,224 INFO L195 NwaCegarLoop]: trace histogram [18, 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] [2022-12-13 16:22:35,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 16:22:35,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 16:22:35,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1109252130, now seen corresponding path program 3 times [2022-12-13 16:22:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:35,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573835555] [2022-12-13 16:22:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573835555] [2022-12-13 16:22:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573835555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115933600] [2022-12-13 16:22:36,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:22:36,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:36,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:36,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:36,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:22:44,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-13 16:22:44,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:22:45,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 16:22:45,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:45,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:22:45,412 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 16:22:45,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 16:22:45,569 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 16:22:45,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-12-13 16:22:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:45,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:45,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-12-13 16:22:45,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-12-13 16:22:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115933600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:22:46,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:22:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 63 [2022-12-13 16:22:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133444948] [2022-12-13 16:22:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-13 16:22:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 16:22:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3711, Unknown=0, NotChecked=0, Total=3906 [2022-12-13 16:22:46,511 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 62 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:50,573 INFO L93 Difference]: Finished difference Result 407 states and 478 transitions. [2022-12-13 16:22:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 16:22:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 62 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2022-12-13 16:22:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:50,575 INFO L225 Difference]: With dead ends: 407 [2022-12-13 16:22:50,575 INFO L226 Difference]: Without dead ends: 211 [2022-12-13 16:22:50,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1009, Invalid=8693, Unknown=0, NotChecked=0, Total=9702 [2022-12-13 16:22:50,577 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 492 mSDsluCounter, 5093 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:50,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 5240 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 16:22:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-12-13 16:22:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-12-13 16:22:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 198 states have internal predecessors, (221), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:22:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2022-12-13 16:22:50,594 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 53 [2022-12-13 16:22:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:50,594 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2022-12-13 16:22:50,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 62 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 16:22:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2022-12-13 16:22:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 16:22:50,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:22:50,595 INFO L195 NwaCegarLoop]: trace histogram [19, 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] [2022-12-13 16:22:50,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:22:50,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 16:22:50,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2022-12-13 16:22:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:22:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 408282624, now seen corresponding path program 1 times [2022-12-13 16:22:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:22:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123386693] [2022-12-13 16:22:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:22:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:22:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:22:51,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123386693] [2022-12-13 16:22:51,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123386693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:22:51,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069933504] [2022-12-13 16:22:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:22:51,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:51,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:22:51,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:22:51,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:22:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:22:51,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 16:22:51,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:22:52,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:22:52,343 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 16:22:52,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 16:22:52,399 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 16:22:52,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 16:22:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:22:52,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:22:52,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-12-13 16:22:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 1 proven. 189 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:52,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:22:52,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-13 16:22:52,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-13 16:22:52,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 470 [2022-12-13 16:22:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:22:53,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069933504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:22:53,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:22:53,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 24] total 67 [2022-12-13 16:22:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121021895] [2022-12-13 16:22:53,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:22:53,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 16:22:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:22:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 16:22:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4209, Unknown=0, NotChecked=0, Total=4422 [2022-12-13 16:22:53,887 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 67 states, 67 states have (on average 1.671641791044776) internal successors, (112), 66 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:22:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:22:54,640 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2022-12-13 16:22:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 16:22:54,640 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.671641791044776) internal successors, (112), 66 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-12-13 16:22:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:22:54,640 INFO L225 Difference]: With dead ends: 218 [2022-12-13 16:22:54,640 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 16:22:54,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=264, Invalid=4992, Unknown=0, NotChecked=0, Total=5256 [2022-12-13 16:22:54,641 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:22:54,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 509 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:22:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 16:22:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 16:22:54,642 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-12-13 16:22:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 16:22:54,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-12-13 16:22:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:22:54,642 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 16:22:54,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.671641791044776) internal successors, (112), 66 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 16:22:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 16:22:54,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 16:22:54,644 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2022-12-13 16:22:54,645 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2022-12-13 16:22:54,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2022-12-13 16:22:54,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2022-12-13 16:22:54,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:22:54,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:22:54,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 16:22:55,772 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,773 INFO L895 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |#Ultimate.C_memset_#ptr.base|))) (let ((.cse3 (mod |#Ultimate.C_memset_#amount| 4294967296)) (.cse0 (select |old(#memory_int)| |~#smp_def_rrlen_arr~0.base|)) (.cse5 (exists ((|v_#Ultimate.C_memset_#t~loopctr196_71| Int)) (and (<= (+ |v_#Ultimate.C_memset_#t~loopctr196_71| 1) |#Ultimate.C_memset_#t~loopctr196|) (<= |v_#Ultimate.C_memset_#t~loopctr196_71| 16) (<= 16 |v_#Ultimate.C_memset_#t~loopctr196_71|) (<= (select .cse4 (+ |v_#Ultimate.C_memset_#t~loopctr196_71| |#Ultimate.C_memset_#ptr.offset|)) |#Ultimate.C_memset_#value|)))) (.cse1 (exists ((v_ArrVal_352 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.C_memset_#ptr.base| v_ArrVal_352)))) (.cse2 (<= (+ (* (div |#Ultimate.C_memset_#amount| 4294967296) 4294967296) 1) |#Ultimate.C_memset_#amount|))) (or (not (<= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 8)) 6)) (and .cse1 (<= |#Ultimate.C_memset_#t~loopctr196| 16) .cse2 (<= 16 |#Ultimate.C_memset_#t~loopctr196|)) (and (<= |#Ultimate.C_memset_#t~loopctr196| 6) .cse1 (<= 6 |#Ultimate.C_memset_#t~loopctr196|) (< (mod (+ |#Ultimate.C_memset_#t~loopctr196| 4294967295) 4294967296) .cse3)) (and (<= |#Ultimate.C_memset_#t~loopctr196| 4) .cse1 (<= 4 |#Ultimate.C_memset_#t~loopctr196|) .cse2) (and (<= |#Ultimate.C_memset_#t~loopctr196| 15) .cse1 .cse2 (<= 15 |#Ultimate.C_memset_#t~loopctr196|)) (and (<= |#Ultimate.C_memset_#t~loopctr196| 0) (= |#memory_int| |old(#memory_int)|) (<= 0 |#Ultimate.C_memset_#t~loopctr196|)) (not (= (select |#valid| 12) 1)) (and (<= 9 |#Ultimate.C_memset_#t~loopctr196|) (<= |#Ultimate.C_memset_#t~loopctr196| 9) .cse1 .cse2) (and (<= |#Ultimate.C_memset_#t~loopctr196| 8) (<= 8 |#Ultimate.C_memset_#t~loopctr196|) .cse1 (< (mod (+ |#Ultimate.C_memset_#t~loopctr196| 4294967293) 4294967296) .cse3)) (and .cse1 (<= |#Ultimate.C_memset_#t~loopctr196| 13) (<= 13 |#Ultimate.C_memset_#t~loopctr196|) .cse2) (not (= |~#smp_def_rrlen_arr~0.offset| 0)) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr196_130| Int)) (and (<= 16 |v_#Ultimate.C_memset_#t~loopctr196_130|) (<= |v_#Ultimate.C_memset_#t~loopctr196_130| 16) (<= (+ |v_#Ultimate.C_memset_#t~loopctr196_130| 1) |#Ultimate.C_memset_#t~loopctr196|) (<= |#Ultimate.C_memset_#value| (select .cse4 (+ |v_#Ultimate.C_memset_#t~loopctr196_130| |#Ultimate.C_memset_#ptr.offset|))))) .cse5 .cse1 .cse2) (and (<= 5 |#Ultimate.C_memset_#t~loopctr196|) (<= |#Ultimate.C_memset_#t~loopctr196| 5) .cse1 .cse2) (and (<= 7 |#Ultimate.C_memset_#t~loopctr196|) .cse1 (<= |#Ultimate.C_memset_#t~loopctr196| 7) (< (mod (+ |#Ultimate.C_memset_#t~loopctr196| 4294967294) 4294967296) .cse3)) (and (<= |#Ultimate.C_memset_#t~loopctr196| 14) (<= 14 |#Ultimate.C_memset_#t~loopctr196|) .cse1 .cse2) (not (= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 24)) 2)) (not (= |~#smp_def_rrlen_arr~0.base| 12)) (and (<= 2 |#Ultimate.C_memset_#t~loopctr196|) (<= |#Ultimate.C_memset_#t~loopctr196| 2) .cse1 .cse2) (and .cse1 (<= 11 |#Ultimate.C_memset_#t~loopctr196|) .cse2 (<= |#Ultimate.C_memset_#t~loopctr196| 11)) (and (<= 10 |#Ultimate.C_memset_#t~loopctr196|) .cse1 .cse2 (<= |#Ultimate.C_memset_#t~loopctr196| 10)) (and .cse1 .cse2 (<= 1 |#Ultimate.C_memset_#t~loopctr196|) (<= |#Ultimate.C_memset_#t~loopctr196| 1)) (and (<= |#Ultimate.C_memset_#t~loopctr196| 12) (<= 12 |#Ultimate.C_memset_#t~loopctr196|) .cse1 .cse2) (and (exists ((|v_#Ultimate.C_memset_#t~loopctr196_130| Int)) (and (<= 16 |v_#Ultimate.C_memset_#t~loopctr196_130|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr196_130| 2) |#Ultimate.C_memset_#t~loopctr196|) (<= |v_#Ultimate.C_memset_#t~loopctr196_130| 16) (<= |#Ultimate.C_memset_#value| (select .cse4 (+ |v_#Ultimate.C_memset_#t~loopctr196_130| |#Ultimate.C_memset_#ptr.offset|))))) .cse5 .cse1) (and .cse1 (<= 3 |#Ultimate.C_memset_#t~loopctr196|) .cse2 (<= |#Ultimate.C_memset_#t~loopctr196| 3))))) [2022-12-13 16:22:55,773 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#smp_def_rrlen_arr~0.base|))) (or (not (<= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 8)) 6)) (not (= (select |#valid| 12) 1)) (= |#memory_int| |old(#memory_int)|) (not (= |~#smp_def_rrlen_arr~0.offset| 0)) (not (= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 24)) 2)) (not (= |~#smp_def_rrlen_arr~0.base| 12)))) [2022-12-13 16:22:55,773 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 195) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 433) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 198) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L432-2(lines 432 433) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 186) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-1(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-2(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-3(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-4(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L895 garLoopResultBuilder]: At program point L218-6(line 218) the Hoare annotation is: false [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-7(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L218-8(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 467) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,774 INFO L899 garLoopResultBuilder]: For program point L202-1(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L202-2(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L202-3(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L202-4(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L895 garLoopResultBuilder]: At program point L202-6(line 202) the Hoare annotation is: false [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L202-7(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L202-8(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L450-2(lines 450 458) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L450-3(lines 450 458) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 210) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 487) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 200) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 469) no Hoare annotation was computed. [2022-12-13 16:22:55,775 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#smp_def_rrlen_arr~0.base|))) (and (= |ULTIMATE.start_do_discover_list_~max_resp_len#1| 4) (not (= |ULTIMATE.start_do_discover_list_~#smp_rr~0#1.base| 12)) (<= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 8)) 6) (= |ULTIMATE.start_do_discover_list_~#smp_rr~0#1.offset| 0) (not (= |ULTIMATE.start_do_discover_list_~#smp_rr~0#1.base| |ULTIMATE.start_do_discover_list_~#smp_req~0#1.base|)) (= (select .cse0 (+ |~#smp_def_rrlen_arr~0.offset| 24)) 2) (= |~#smp_def_rrlen_arr~0.offset| 0) (= (select |#valid| 12) 1) (not (= |~#smp_def_rrlen_arr~0.base| |ULTIMATE.start_do_discover_list_~#smp_req~0#1.base|)) (= |~#smp_def_rrlen_arr~0.base| 12))) [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L204(line 204) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L204-1(line 204) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L895 garLoopResultBuilder]: At program point L204-2(line 204) the Hoare annotation is: false [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L204-3(line 204) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 200) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 457) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 209) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 473) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L437(lines 437 440) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L895 garLoopResultBuilder]: At program point L173(lines 173 222) the Hoare annotation is: (= |ULTIMATE.start_do_discover_list_~max_resp_len#1| 4) [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 195) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 209) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 208) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point L207-2(lines 207 208) no Hoare annotation was computed. [2022-12-13 16:22:55,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L422(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L422-1(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L422-2(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L422-3(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L209-1(line 209) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 215) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 491 498) the Hoare annotation is: (= |ULTIMATE.start_do_discover_list_~max_resp_len#1| 4) [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L441(lines 441 444) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 199) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 422) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L194-1(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,777 INFO L899 garLoopResultBuilder]: For program point L194-2(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L194-3(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L194-4(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L895 garLoopResultBuilder]: At program point L194-6(line 194) the Hoare annotation is: false [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L194-7(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L194-8(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 199) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 211 219) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L426(lines 426 427) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L459-1(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L459-2(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L426-2(lines 426 427) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 166) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L195-2(lines 195 220) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L195-3(line 195) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L162-3(lines 162 166) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L195-4(line 195) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L895 garLoopResultBuilder]: At program point L162-4(lines 162 166) the Hoare annotation is: false [2022-12-13 16:22:55,778 INFO L895 garLoopResultBuilder]: At program point L195-5(lines 195 220) the Hoare annotation is: false [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L162-5(lines 162 166) no Hoare annotation was computed. [2022-12-13 16:22:55,778 INFO L899 garLoopResultBuilder]: For program point L195-6(lines 195 220) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L476(lines 476 479) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 204) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L895 garLoopResultBuilder]: At program point smp_get_func_def_resp_len_returnLabel#1(lines 159 168) the Hoare annotation is: false [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L460(line 460) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L460-2(lines 460 475) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 204) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 218) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 429) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L428-2(lines 428 429) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 165) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L462(lines 462 465) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 215) no Hoare annotation was computed. [2022-12-13 16:22:55,779 INFO L899 garLoopResultBuilder]: For program point L462-2(lines 462 465) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L198-1(line 198) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 459) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L215-1(line 215) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 202) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L199-1(line 199) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 199 200) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L895 garLoopResultBuilder]: At program point L199-4(lines 199 200) the Hoare annotation is: false [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 483) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L895 garLoopResultBuilder]: At program point do_discover_list_returnLabel#1(lines 414 489) the Hoare annotation is: (= |ULTIMATE.start_do_discover_list_~max_resp_len#1| 4) [2022-12-13 16:22:55,780 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 198) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L200-1(line 200) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 156) no Hoare annotation was computed. [2022-12-13 16:22:55,780 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 153 158) no Hoare annotation was computed. [2022-12-13 16:22:55,781 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 153 158) the Hoare annotation is: true [2022-12-13 16:22:55,781 INFO L899 garLoopResultBuilder]: For program point L154-2(lines 153 158) no Hoare annotation was computed. [2022-12-13 16:22:55,783 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:22:55,784 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:22:55,790 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,791 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,792 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,793 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,794 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,795 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,803 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,804 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,805 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,806 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:22:55 BoogieIcfgContainer [2022-12-13 16:22:55,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:22:55,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:22:55,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:22:55,809 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:22:55,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:22:17" (3/4) ... [2022-12-13 16:22:55,811 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 16:22:55,816 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-12-13 16:22:55,816 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 16:22:55,822 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-12-13 16:22:55,823 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-12-13 16:22:55,823 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 16:22:55,824 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 16:22:55,824 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 16:22:55,824 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 16:22:55,841 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(unknown-#memory_int-unknown)[smp_def_rrlen_arr][smp_def_rrlen_arr + 8] <= 6) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && aux-#t~loopctr196-aux <= 16) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 16 <= aux-#t~loopctr196-aux)) || (((aux-#t~loopctr196-aux <= 6 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && 6 <= aux-#t~loopctr196-aux) && (aux-#t~loopctr196-aux + 4294967295) % 4294967296 < unknown-#amount-unknown % 4294967296)) || (((aux-#t~loopctr196-aux <= 4 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && 4 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((aux-#t~loopctr196-aux <= 15 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 15 <= aux-#t~loopctr196-aux)) || ((aux-#t~loopctr196-aux <= 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 0 <= aux-#t~loopctr196-aux)) || !(\valid[12] == 1)) || (((9 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 9) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((aux-#t~loopctr196-aux <= 8 && 8 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && (aux-#t~loopctr196-aux + 4294967293) % 4294967296 < unknown-#amount-unknown % 4294967296)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && aux-#t~loopctr196-aux <= 13) && 13 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || !(smp_def_rrlen_arr == 0)) || ((((\exists v_#Ultimate.C_memset_#t~loopctr196_130 : int :: ((16 <= v_#Ultimate.C_memset_#t~loopctr196_130 && v_#Ultimate.C_memset_#t~loopctr196_130 <= 16) && v_#Ultimate.C_memset_#t~loopctr196_130 + 1 <= aux-#t~loopctr196-aux) && unknown-#value-unknown <= unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_130 + #ptr]) && (\exists v_#Ultimate.C_memset_#t~loopctr196_71 : int :: ((v_#Ultimate.C_memset_#t~loopctr196_71 + 1 <= aux-#t~loopctr196-aux && v_#Ultimate.C_memset_#t~loopctr196_71 <= 16) && 16 <= v_#Ultimate.C_memset_#t~loopctr196_71) && unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_71 + #ptr] <= unknown-#value-unknown)) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((5 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 5) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((7 <= aux-#t~loopctr196-aux && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && aux-#t~loopctr196-aux <= 7) && (aux-#t~loopctr196-aux + 4294967294) % 4294967296 < unknown-#amount-unknown % 4294967296)) || (((aux-#t~loopctr196-aux <= 14 && 14 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || !(\old(unknown-#memory_int-unknown)[smp_def_rrlen_arr][smp_def_rrlen_arr + 24] == 2)) || !(smp_def_rrlen_arr == 12)) || (((2 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 2) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && 11 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 11)) || (((10 <= aux-#t~loopctr196-aux && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 10)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 1 <= aux-#t~loopctr196-aux) && aux-#t~loopctr196-aux <= 1)) || (((aux-#t~loopctr196-aux <= 12 && 12 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((\exists v_#Ultimate.C_memset_#t~loopctr196_130 : int :: ((16 <= v_#Ultimate.C_memset_#t~loopctr196_130 && v_#Ultimate.C_memset_#t~loopctr196_130 + 2 <= aux-#t~loopctr196-aux) && v_#Ultimate.C_memset_#t~loopctr196_130 <= 16) && unknown-#value-unknown <= unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_130 + #ptr]) && (\exists v_#Ultimate.C_memset_#t~loopctr196_71 : int :: ((v_#Ultimate.C_memset_#t~loopctr196_71 + 1 <= aux-#t~loopctr196-aux && v_#Ultimate.C_memset_#t~loopctr196_71 <= 16) && 16 <= v_#Ultimate.C_memset_#t~loopctr196_71) && unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_71 + #ptr] <= unknown-#value-unknown)) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]))) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && 3 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 3) [2022-12-13 16:22:55,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:22:55,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:22:55,876 INFO L158 Benchmark]: Toolchain (without parser) took 39906.05ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 99.8MB in the beginning and 112.1MB in the end (delta: -12.4MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,876 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:22:55,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.30ms. Allocated memory is still 165.7MB. Free memory was 99.5MB in the beginning and 122.1MB in the end (delta: -22.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 165.7MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,876 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,877 INFO L158 Benchmark]: RCFGBuilder took 649.78ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 76.1MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,877 INFO L158 Benchmark]: TraceAbstraction took 38749.74ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 75.9MB in the beginning and 122.8MB in the end (delta: -46.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,877 INFO L158 Benchmark]: Witness Printer took 66.43ms. Allocated memory is still 209.7MB. Free memory was 122.8MB in the beginning and 112.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 16:22:55,878 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.17ms. Allocated memory is still 165.7MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.30ms. Allocated memory is still 165.7MB. Free memory was 99.5MB in the beginning and 122.1MB in the end (delta: -22.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 165.7MB. Free memory was 122.1MB in the beginning and 117.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 649.78ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 76.1MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38749.74ms. Allocated memory was 165.7MB in the beginning and 209.7MB in the end (delta: 44.0MB). Free memory was 75.9MB in the beginning and 122.8MB in the end (delta: -46.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 66.43ms. Allocated memory is still 209.7MB. Free memory was 122.8MB in the beginning and 112.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] * 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: 422]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 422]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 422]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 422]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 459]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 459]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 459]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 459]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 198]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 198]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 199]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 199]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 204]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 204]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 209]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 209]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 215]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 215]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 218]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: 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 3 procedures, 155 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 38.7s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 93 mSolverCounterUnknown, 1526 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1485 mSDsluCounter, 16459 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14530 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6190 IncrementalHoareTripleChecker+Invalid, 6547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 1929 mSDtfsCounter, 6190 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 328 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=11, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 367 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 99 PreInvPairs, 123 NumberOfFragments, 632 HoareAnnotationTreeSize, 99 FomulaSimplifications, 103 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 830 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 10.9s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 808 ConstructedInterpolants, 26 QuantifiedInterpolants, 4724 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3838 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 38/1253 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant [2022-12-13 16:22:55,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,883 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,884 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,885 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,886 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,887 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,888 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,890 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,891 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,892 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,893 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,894 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_130,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_#Ultimate.C_memset_#t~loopctr196_71,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] [2022-12-13 16:22:55,895 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_352,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((!(\old(unknown-#memory_int-unknown)[smp_def_rrlen_arr][smp_def_rrlen_arr + 8] <= 6) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && aux-#t~loopctr196-aux <= 16) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 16 <= aux-#t~loopctr196-aux)) || (((aux-#t~loopctr196-aux <= 6 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && 6 <= aux-#t~loopctr196-aux) && (aux-#t~loopctr196-aux + 4294967295) % 4294967296 < unknown-#amount-unknown % 4294967296)) || (((aux-#t~loopctr196-aux <= 4 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && 4 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((aux-#t~loopctr196-aux <= 15 && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 15 <= aux-#t~loopctr196-aux)) || ((aux-#t~loopctr196-aux <= 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 0 <= aux-#t~loopctr196-aux)) || !(\valid[12] == 1)) || (((9 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 9) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((aux-#t~loopctr196-aux <= 8 && 8 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && (aux-#t~loopctr196-aux + 4294967293) % 4294967296 < unknown-#amount-unknown % 4294967296)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && aux-#t~loopctr196-aux <= 13) && 13 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || !(smp_def_rrlen_arr == 0)) || ((((\exists v_#Ultimate.C_memset_#t~loopctr196_130 : int :: ((16 <= v_#Ultimate.C_memset_#t~loopctr196_130 && v_#Ultimate.C_memset_#t~loopctr196_130 <= 16) && v_#Ultimate.C_memset_#t~loopctr196_130 + 1 <= aux-#t~loopctr196-aux) && unknown-#value-unknown <= unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_130 + #ptr]) && (\exists v_#Ultimate.C_memset_#t~loopctr196_71 : int :: ((v_#Ultimate.C_memset_#t~loopctr196_71 + 1 <= aux-#t~loopctr196-aux && v_#Ultimate.C_memset_#t~loopctr196_71 <= 16) && 16 <= v_#Ultimate.C_memset_#t~loopctr196_71) && unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_71 + #ptr] <= unknown-#value-unknown)) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((5 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 5) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((7 <= aux-#t~loopctr196-aux && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && aux-#t~loopctr196-aux <= 7) && (aux-#t~loopctr196-aux + 4294967294) % 4294967296 < unknown-#amount-unknown % 4294967296)) || (((aux-#t~loopctr196-aux <= 14 && 14 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || !(\old(unknown-#memory_int-unknown)[smp_def_rrlen_arr][smp_def_rrlen_arr + 24] == 2)) || !(smp_def_rrlen_arr == 12)) || (((2 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 2) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && 11 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 11)) || (((10 <= aux-#t~loopctr196-aux && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 10)) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && 1 <= aux-#t~loopctr196-aux) && aux-#t~loopctr196-aux <= 1)) || (((aux-#t~loopctr196-aux <= 12 && 12 <= aux-#t~loopctr196-aux) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352])) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown)) || (((\exists v_#Ultimate.C_memset_#t~loopctr196_130 : int :: ((16 <= v_#Ultimate.C_memset_#t~loopctr196_130 && v_#Ultimate.C_memset_#t~loopctr196_130 + 2 <= aux-#t~loopctr196-aux) && v_#Ultimate.C_memset_#t~loopctr196_130 <= 16) && unknown-#value-unknown <= unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_130 + #ptr]) && (\exists v_#Ultimate.C_memset_#t~loopctr196_71 : int :: ((v_#Ultimate.C_memset_#t~loopctr196_71 + 1 <= aux-#t~loopctr196-aux && v_#Ultimate.C_memset_#t~loopctr196_71 <= 16) && 16 <= v_#Ultimate.C_memset_#t~loopctr196_71) && unknown-#memory_int-unknown[#ptr][v_#Ultimate.C_memset_#t~loopctr196_71 + #ptr] <= unknown-#value-unknown)) && (\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]))) || ((((\exists v_ArrVal_352 : [int]int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := v_ArrVal_352]) && 3 <= aux-#t~loopctr196-aux) && unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown) && aux-#t~loopctr196-aux <= 3) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: max_resp_len == 4 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: max_resp_len == 4 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: max_resp_len == 4 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 16:22:55,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b187cb0-0f33-4f43-a120-1cafb38b3fc6/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE