./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 6b4ec56b 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_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/config/KojakReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ --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 Kojak --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-6b4ec56 [2022-11-20 17:10:22,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 17:10:22,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 17:10:22,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 17:10:22,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 17:10:22,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 17:10:22,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 17:10:22,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 17:10:22,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 17:10:22,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 17:10:22,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 17:10:22,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 17:10:22,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 17:10:22,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 17:10:22,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 17:10:22,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 17:10:22,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 17:10:22,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 17:10:22,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 17:10:22,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 17:10:22,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 17:10:22,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 17:10:22,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 17:10:22,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 17:10:22,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 17:10:22,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 17:10:22,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 17:10:22,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 17:10:22,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 17:10:22,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 17:10:22,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 17:10:22,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 17:10:22,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 17:10:22,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 17:10:22,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 17:10:22,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 17:10:22,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 17:10:22,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 17:10:22,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 17:10:22,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 17:10:22,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 17:10:22,218 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/config/svcomp-Overflow-32bit-Kojak_Default.epf [2022-11-20 17:10:22,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 17:10:22,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 17:10:22,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 17:10:22,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-11-20 17:10:22,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 17:10:22,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 17:10:22,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 17:10:22,266 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 17:10:22,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 17:10:22,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 17:10:22,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 17:10:22,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 17:10:22,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 17:10:22,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 17:10:22,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 17:10:22,268 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 17:10:22,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 17:10:22,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 17:10:22,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 17:10:22,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 17:10:22,269 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-11-20 17:10:22,269 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-11-20 17:10:22,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 17:10:22,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-20 17:10:22,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 17:10:22,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 17:10:22,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 17:10:22,270 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-11-20 17:10:22,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 17:10:22,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 17:10:22,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/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_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ 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 -> Kojak 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-11-20 17:10:22,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 17:10:22,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 17:10:22,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 17:10:22,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 17:10:22,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 17:10:22,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/../../sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-11-20 17:10:25,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 17:10:25,999 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 17:10:26,000 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-11-20 17:10:26,009 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/data/d4dfeb384/51c60fa7742a4047a639f82b19ed2064/FLAGd3ca203cd [2022-11-20 17:10:26,024 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/data/d4dfeb384/51c60fa7742a4047a639f82b19ed2064 [2022-11-20 17:10:26,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 17:10:26,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 17:10:26,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 17:10:26,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 17:10:26,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 17:10:26,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ef12bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26, skipping insertion in model container [2022-11-20 17:10:26,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 17:10:26,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 17:10:26,304 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_60d6a168-7c3e-4abc-adb3-30cb7df34201/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-11-20 17:10:26,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 17:10:26,446 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 17:10:26,489 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_60d6a168-7c3e-4abc-adb3-30cb7df34201/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-11-20 17:10:26,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 17:10:26,593 INFO L208 MainTranslator]: Completed translation [2022-11-20 17:10:26,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26 WrapperNode [2022-11-20 17:10:26,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 17:10:26,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 17:10:26,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 17:10:26,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 17:10:26,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,681 INFO L138 Inliner]: procedures = 36, calls = 639, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 546 [2022-11-20 17:10:26,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 17:10:26,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 17:10:26,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 17:10:26,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 17:10:26,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,774 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 17:10:26,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 17:10:26,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 17:10:26,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 17:10:26,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:10:26" (1/1) ... [2022-11-20 17:10:26,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-11-20 17:10:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/z3 [2022-11-20 17:10:26,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-11-20 17:10:26,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-11-20 17:10:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 17:10:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 17:10:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 17:10:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 17:10:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2022-11-20 17:10:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-20 17:10:26,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-20 17:10:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 17:10:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 17:10:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 17:10:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 17:10:26,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 17:10:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 17:10:26,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 17:10:27,046 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 17:10:27,049 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 17:10:27,810 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 17:10:28,005 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 17:10:28,005 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 17:10:28,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:28 BoogieIcfgContainer [2022-11-20 17:10:28,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 17:10:28,011 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-11-20 17:10:28,011 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-11-20 17:10:28,022 INFO L275 PluginConnector]: CodeCheck initialized [2022-11-20 17:10:28,022 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:28" (1/1) ... [2022-11-20 17:10:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 17:10:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 128 states and 152 transitions. [2022-11-20 17:10:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2022-11-20 17:10:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 17:10:28,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 127 states and 151 transitions. [2022-11-20 17:10:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-11-20 17:10:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 17:10:28,733 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 126 states and 150 transitions. [2022-11-20 17:10:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2022-11-20 17:10:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 17:10:28,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 125 states and 149 transitions. [2022-11-20 17:10:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2022-11-20 17:10:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 17:10:29,108 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 124 states and 148 transitions. [2022-11-20 17:10:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-11-20 17:10:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 17:10:29,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 125 states and 150 transitions. [2022-11-20 17:10:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-11-20 17:10:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 17:10:29,709 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 124 states and 149 transitions. [2022-11-20 17:10:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2022-11-20 17:10:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 17:10:29,965 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 126 states and 151 transitions. [2022-11-20 17:10:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-11-20 17:10:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 17:10:30,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 125 states and 150 transitions. [2022-11-20 17:10:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-11-20 17:10:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 17:10:30,320 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 125 states and 149 transitions. [2022-11-20 17:10:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2022-11-20 17:10:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 17:10:30,408 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:30,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 127 states and 152 transitions. [2022-11-20 17:10:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2022-11-20 17:10:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 17:10:30,800 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 129 states and 155 transitions. [2022-11-20 17:10:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2022-11-20 17:10:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 17:10:31,474 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 130 states and 156 transitions. [2022-11-20 17:10:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2022-11-20 17:10:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 17:10:32,126 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 131 states and 157 transitions. [2022-11-20 17:10:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-11-20 17:10:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 17:10:32,767 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 133 states and 161 transitions. [2022-11-20 17:10:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2022-11-20 17:10:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 17:10:33,919 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 134 states and 162 transitions. [2022-11-20 17:10:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2022-11-20 17:10:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 17:10:34,874 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 135 states and 163 transitions. [2022-11-20 17:10:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2022-11-20 17:10:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 17:10:35,906 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 136 states and 164 transitions. [2022-11-20 17:10:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2022-11-20 17:10:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 17:10:36,934 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 137 states and 165 transitions. [2022-11-20 17:10:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2022-11-20 17:10:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 17:10:38,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 138 states and 166 transitions. [2022-11-20 17:10:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-11-20 17:10:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 17:10:39,283 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 139 states and 167 transitions. [2022-11-20 17:10:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 167 transitions. [2022-11-20 17:10:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 17:10:40,521 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 140 states and 168 transitions. [2022-11-20 17:10:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2022-11-20 17:10:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 17:10:42,494 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 141 states and 169 transitions. [2022-11-20 17:10:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 169 transitions. [2022-11-20 17:10:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 17:10:44,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 142 states and 170 transitions. [2022-11-20 17:10:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-11-20 17:10:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 17:10:45,361 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 143 states and 171 transitions. [2022-11-20 17:10:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2022-11-20 17:10:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 17:10:46,762 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 144 states and 172 transitions. [2022-11-20 17:10:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2022-11-20 17:10:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 17:10:48,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 145 states and 173 transitions. [2022-11-20 17:10:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2022-11-20 17:10:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 17:10:50,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 146 states and 174 transitions. [2022-11-20 17:10:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-11-20 17:10:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 17:10:51,815 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 147 states and 175 transitions. [2022-11-20 17:10:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2022-11-20 17:10:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 17:10:53,017 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 148 states and 176 transitions. [2022-11-20 17:10:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-11-20 17:10:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 17:10:54,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 149 states and 177 transitions. [2022-11-20 17:10:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2022-11-20 17:10:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 17:10:55,609 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 150 states and 178 transitions. [2022-11-20 17:10:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2022-11-20 17:10:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 17:10:58,326 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:58,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:10:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:10:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:10:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:10:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 151 states and 179 transitions. [2022-11-20 17:10:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2022-11-20 17:10:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 17:10:59,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:10:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:11:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:11:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:11:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:11:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 152 states and 180 transitions. [2022-11-20 17:11:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2022-11-20 17:11:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 17:11:07,449 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:11:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:11:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:11:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 91 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:11:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:11:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 157 states and 189 transitions. [2022-11-20 17:11:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2022-11-20 17:11:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 17:11:40,280 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:11:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:11:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:11:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-20 17:11:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:11:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 158 states and 191 transitions. [2022-11-20 17:11:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 191 transitions. [2022-11-20 17:11:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 17:11:41,821 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:11:41,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:11:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:11:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 3 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 17:12:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:12:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 165 states and 210 transitions. [2022-11-20 17:12:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2022-11-20 17:12:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 17:12:10,002 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-11-20 17:12:10,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 17:12:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 17:12:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 15 proven. 285 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 17:12:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-11-20 17:12:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 42 states and 48 transitions. [2022-11-20 17:12:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-20 17:12:42,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 17:12:42,839 WARN L419 CodeCheckObserver]: This Program is SAFE, Check terminated with 38 iterations. [2022-11-20 17:12:42,847 INFO L754 CodeCheckObserver]: All specifications hold 42 specifications checked. All of them hold [2022-11-20 17:12:44,224 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2022-11-20 17:12:44,228 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2022-11-20 17:12:44,229 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2022-11-20 17:12:44,229 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2022-11-20 17:12:44,229 INFO L560 CodeCheckObserver]: Invariant with dag size 1 [2022-11-20 17:12:44,229 INFO L560 CodeCheckObserver]: Invariant with dag size 131 [2022-11-20 17:12:44,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 05:12:44 ImpRootNode [2022-11-20 17:12:44,254 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-11-20 17:12:44,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 17:12:44,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 17:12:44,255 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 17:12:44,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:10:28" (3/4) ... [2022-11-20 17:12:44,258 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 17:12:44,263 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-11-20 17:12:44,264 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 17:12:44,273 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2022-11-20 17:12:44,274 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 17:12:44,275 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-20 17:12:44,275 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 17:12:44,276 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 17:12:44,277 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 17:12:44,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(aux-#t~loopctr196-aux <= 6) && aux-#t~loopctr196-aux <= 7) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0))) || ((aux-#t~loopctr196-aux <= 4 && !(aux-#t~loopctr196-aux <= 3)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 14 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 13))) || (((!(aux-#t~loopctr196-aux <= 17) && aux-#t~loopctr196-aux <= 18) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0)))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && !(aux-#t~loopctr196-aux <= 10)) && aux-#t~loopctr196-aux <= 11)) || ((1 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 1) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((!(aux-#t~loopctr196-aux <= 12) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 13)) || ((aux-#t~loopctr196-aux <= 15 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 14))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 10) && !(aux-#t~loopctr196-aux <= 9))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 9) && !(aux-#t~loopctr196-aux <= 8))) || (((!(aux-#t~loopctr196-aux <= 16) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 17)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 19) && !(aux-#t~loopctr196-aux <= 18))) || (((!(aux-#t~loopctr196-aux <= 19) && aux-#t~loopctr196-aux <= 20) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 8 && !(aux-#t~loopctr196-aux <= 7)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 16) && !(aux-#t~loopctr196-aux <= 15))) || ((((unknown-#amount-unknown == 24 && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8] || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && !(unknown-#amount-unknown / 4294967296 <= aux-#t~loopctr196-aux / 4294967296)) && ((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 20] && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]]) || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 6 && !(aux-#t~loopctr196-aux <= 5)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 5 && !(aux-#t~loopctr196-aux <= 4)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8] || !(#ptr == 0)) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 20)) && ((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 20] && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]]) || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 12 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 11))) || (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && aux-#t~loopctr196-aux == 0)) || ((!(unknown-#amount-unknown == 24) && !((unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown && 1 <= aux-#t~loopctr196-aux) && aux-#t~loopctr196-aux <= 1)) && !(aux-#t~loopctr196-aux == 0))) || ((aux-#t~loopctr196-aux <= 2 && !(aux-#t~loopctr196-aux <= 1)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((!(aux-#t~loopctr196-aux <= 2) && aux-#t~loopctr196-aux <= 3) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0))) [2022-11-20 17:12:44,405 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/witness.graphml [2022-11-20 17:12:44,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 17:12:44,406 INFO L158 Benchmark]: Toolchain (without parser) took 138377.48ms. Allocated memory was 132.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 66.6MB in the beginning and 758.6MB in the end (delta: -692.0MB). Peak memory consumption was 536.5MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,406 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 17:12:44,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.63ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 66.5MB in the beginning and 128.8MB in the end (delta: -62.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.38ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 124.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,407 INFO L158 Benchmark]: Boogie Preprocessor took 97.61ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 121.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,408 INFO L158 Benchmark]: RCFGBuilder took 1228.90ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 93.6MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,408 INFO L158 Benchmark]: CodeCheck took 136242.72ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 93.6MB in the beginning and 769.1MB in the end (delta: -675.5MB). Peak memory consumption was 508.3MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,409 INFO L158 Benchmark]: Witness Printer took 151.04ms. Allocated memory is still 1.4GB. Free memory was 769.1MB in the beginning and 758.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 17:12:44,410 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 128 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 134.8s, OverallIterations: 38, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2501 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 1071 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 2582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5313 IncrementalHoareTripleChecker+Invalid, 7895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2582 mSolverCounterUnsat, 837 mSDtfsCounter, 5313 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7693 GetRequests, 6723 SyntacticMatches, 308 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241920 ImplicationChecksByTransitivity, 108.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 48.0s InterpolantComputationTime, 1011 NumberOfCodeBlocks, 1011 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 7255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 418/3512 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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 - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(aux-#t~loopctr196-aux <= 6) && aux-#t~loopctr196-aux <= 7) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0))) || ((aux-#t~loopctr196-aux <= 4 && !(aux-#t~loopctr196-aux <= 3)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 14 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 13))) || (((!(aux-#t~loopctr196-aux <= 17) && aux-#t~loopctr196-aux <= 18) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0)))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && !(aux-#t~loopctr196-aux <= 10)) && aux-#t~loopctr196-aux <= 11)) || ((1 <= aux-#t~loopctr196-aux && aux-#t~loopctr196-aux <= 1) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((!(aux-#t~loopctr196-aux <= 12) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 13)) || ((aux-#t~loopctr196-aux <= 15 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 14))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 10) && !(aux-#t~loopctr196-aux <= 9))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 9) && !(aux-#t~loopctr196-aux <= 8))) || (((!(aux-#t~loopctr196-aux <= 16) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 17)) || (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && aux-#t~loopctr196-aux <= 19) && !(aux-#t~loopctr196-aux <= 18))) || (((!(aux-#t~loopctr196-aux <= 19) && aux-#t~loopctr196-aux <= 20) && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 8 && !(aux-#t~loopctr196-aux <= 7)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0)) && aux-#t~loopctr196-aux <= 16) && !(aux-#t~loopctr196-aux <= 15))) || ((((unknown-#amount-unknown == 24 && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8] || !(#ptr == 0))) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && !(unknown-#amount-unknown / 4294967296 <= aux-#t~loopctr196-aux / 4294967296)) && ((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 20] && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]]) || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 6 && !(aux-#t~loopctr196-aux <= 5)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 5 && !(aux-#t~loopctr196-aux <= 4)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8] || !(#ptr == 0)) && (unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 16] || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 20)) && ((unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 20] && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]]) || !(#ptr == 0)))) || ((aux-#t~loopctr196-aux <= 12 && ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] && unknown-#value-unknown == unknown-#memory_int-unknown[#ptr][#ptr + 8]) || !(#ptr == 0))) && !(aux-#t~loopctr196-aux <= 11))) || (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && aux-#t~loopctr196-aux == 0)) || ((!(unknown-#amount-unknown == 24) && !((unknown-#amount-unknown / 4294967296 * 4294967296 + 1 <= unknown-#amount-unknown && 1 <= aux-#t~loopctr196-aux) && aux-#t~loopctr196-aux <= 1)) && !(aux-#t~loopctr196-aux == 0))) || ((aux-#t~loopctr196-aux <= 2 && !(aux-#t~loopctr196-aux <= 1)) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0)))) || ((!(aux-#t~loopctr196-aux <= 2) && aux-#t~loopctr196-aux <= 3) && (unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#ptr := unknown-#memory_int-unknown[#ptr]] || !(#ptr == 0))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.63ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 66.5MB in the beginning and 128.8MB in the end (delta: -62.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.38ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 124.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.61ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 121.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1228.90ms. Allocated memory is still 176.2MB. Free memory was 121.3MB in the beginning and 93.6MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * CodeCheck took 136242.72ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 93.6MB in the beginning and 769.1MB in the end (delta: -675.5MB). Peak memory consumption was 508.3MB. Max. memory is 16.1GB. * Witness Printer took 151.04ms. Allocated memory is still 1.4GB. Free memory was 769.1MB in the beginning and 758.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2022-11-20 17:12:44,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60d6a168-7c3e-4abc-adb3-30cb7df34201/bin/ukojak-pZX7IvK2PQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE