./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- 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-5e519f3 [2022-11-03 01:35:38,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:35:38,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:35:39,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:35:39,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:35:39,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:35:39,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:35:39,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:35:39,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:35:39,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:35:39,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:35:39,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:35:39,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:35:39,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:35:39,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:35:39,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:35:39,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:35:39,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:35:39,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:35:39,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:35:39,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:35:39,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:35:39,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:35:39,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:35:39,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:35:39,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:35:39,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:35:39,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:35:39,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:35:39,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:35:39,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:35:39,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:35:39,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:35:39,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:35:39,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:35:39,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:35:39,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:35:39,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:35:39,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:35:39,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:35:39,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:35:39,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-03 01:35:39,079 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:35:39,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:35:39,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:35:39,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:35:39,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:35:39,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:35:39,082 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:35:39,082 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:35:39,082 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:35:39,083 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:35:39,083 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:35:39,083 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:35:39,083 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:35:39,083 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:35:39,084 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:35:39,084 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:35:39,084 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:35:39,084 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:35:39,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:35:39,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:35:39,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:35:39,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:35:39,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:35:39,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:35:39,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:35:39,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:35:39,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:35:39,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:35:39,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:35:39,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:35:39,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:35:39,088 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:35:39,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:35:39,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:35:39,089 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:35:39,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:35:39,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:35:39,090 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:35:39,090 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_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/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_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2022-11-03 01:35:39,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:35:39,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:35:39,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:35:39,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:35:39,421 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:35:39,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2022-11-03 01:35:39,502 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/data/eaf973910/78913d6ec5f7403dbfdd29fb6b907b9d/FLAG7dc4eda1e [2022-11-03 01:35:40,282 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:35:40,282 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2022-11-03 01:35:40,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/data/eaf973910/78913d6ec5f7403dbfdd29fb6b907b9d/FLAG7dc4eda1e [2022-11-03 01:35:40,385 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/data/eaf973910/78913d6ec5f7403dbfdd29fb6b907b9d [2022-11-03 01:35:40,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:35:40,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:35:40,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:35:40,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:35:40,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:35:40,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:40,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eddb796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:40, skipping insertion in model container [2022-11-03 01:35:40,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:35:40" (1/1) ... [2022-11-03 01:35:40,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:35:40,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:35:41,365 WARN L230 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_0499bd0a-1507-48f5-80c8-f0106e3bfab7/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2022-11-03 01:35:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:35:41,457 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:35:41,746 WARN L230 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_0499bd0a-1507-48f5-80c8-f0106e3bfab7/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2022-11-03 01:35:41,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:35:41,806 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:35:41,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41 WrapperNode [2022-11-03 01:35:41,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:35:41,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:35:41,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:35:41,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:35:41,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,883 INFO L138 Inliner]: procedures = 68, calls = 170, calls flagged for inlining = 22, calls inlined = 15, statements flattened = 343 [2022-11-03 01:35:41,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:35:41,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:35:41,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:35:41,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:35:41,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:35:41,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:35:41,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:35:41,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:35:41,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (1/1) ... [2022-11-03 01:35:41,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:35:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:41,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:35:41,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:35:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:35:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:35:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-03 01:35:42,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-03 01:35:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:35:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-03 01:35:42,013 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-03 01:35:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:35:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-11-03 01:35:42,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-11-03 01:35:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:35:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:35:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-03 01:35:42,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-03 01:35:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-03 01:35:42,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-03 01:35:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 01:35:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 01:35:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:35:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:35:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:35:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:35:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-03 01:35:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-03 01:35:42,342 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:35:42,344 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:35:42,407 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-03 01:35:42,807 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:35:42,899 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:35:42,900 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:35:42,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:35:42 BoogieIcfgContainer [2022-11-03 01:35:42,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:35:42,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:35:42,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:35:42,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:35:42,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:35:40" (1/3) ... [2022-11-03 01:35:42,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d84f1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:35:42, skipping insertion in model container [2022-11-03 01:35:42,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:35:41" (2/3) ... [2022-11-03 01:35:42,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d84f1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:35:42, skipping insertion in model container [2022-11-03 01:35:42,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:35:42" (3/3) ... [2022-11-03 01:35:42,912 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2022-11-03 01:35:42,931 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:35:42,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:35:42,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:35:42,989 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31b6ba26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:35:42,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:35:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 51 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 01:35:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:35:43,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:43,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:43,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1444022985, now seen corresponding path program 1 times [2022-11-03 01:35:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:43,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143325699] [2022-11-03 01:35:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:35:43,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:43,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143325699] [2022-11-03 01:35:43,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143325699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:43,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:35:43,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:35:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679779865] [2022-11-03 01:35:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:43,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:35:43,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:35:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:43,631 INFO L87 Difference]: Start difference. First operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 51 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:43,732 INFO L93 Difference]: Finished difference Result 143 states and 208 transitions. [2022-11-03 01:35:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:35:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2022-11-03 01:35:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:43,742 INFO L225 Difference]: With dead ends: 143 [2022-11-03 01:35:43,743 INFO L226 Difference]: Without dead ends: 90 [2022-11-03 01:35:43,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:43,749 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 44 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:43,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 138 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:35:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-03 01:35:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-11-03 01:35:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 71 states have internal predecessors, (99), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:35:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-11-03 01:35:43,794 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 45 [2022-11-03 01:35:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:43,795 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-11-03 01:35:43,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-11-03 01:35:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 01:35:43,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:43,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:43,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:35:43,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash -865740966, now seen corresponding path program 1 times [2022-11-03 01:35:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612333525] [2022-11-03 01:35:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:35:43,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612333525] [2022-11-03 01:35:43,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612333525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:43,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:35:43,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:35:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291820527] [2022-11-03 01:35:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:43,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:35:43,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:35:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:43,961 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:44,024 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2022-11-03 01:35:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:35:44,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-11-03 01:35:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:44,027 INFO L225 Difference]: With dead ends: 133 [2022-11-03 01:35:44,027 INFO L226 Difference]: Without dead ends: 128 [2022-11-03 01:35:44,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:44,029 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:44,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:35:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-03 01:35:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-03 01:35:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.4414414414414414) internal successors, (160), 112 states have internal predecessors, (160), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 01:35:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2022-11-03 01:35:44,046 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 47 [2022-11-03 01:35:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:44,047 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2022-11-03 01:35:44,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2022-11-03 01:35:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-03 01:35:44,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:44,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:44,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:35:44,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1867962773, now seen corresponding path program 1 times [2022-11-03 01:35:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:44,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283520733] [2022-11-03 01:35:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:35:44,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:44,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283520733] [2022-11-03 01:35:44,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283520733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:44,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:35:44,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:35:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918175691] [2022-11-03 01:35:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:44,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:35:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:35:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:44,282 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:44,378 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2022-11-03 01:35:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:35:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2022-11-03 01:35:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:44,383 INFO L225 Difference]: With dead ends: 229 [2022-11-03 01:35:44,383 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 01:35:44,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:35:44,388 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 44 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:44,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:35:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 01:35:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-11-03 01:35:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 01:35:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2022-11-03 01:35:44,418 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 49 [2022-11-03 01:35:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:44,419 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2022-11-03 01:35:44,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-11-03 01:35:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-03 01:35:44,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:44,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:44,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:35:44,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1553772374, now seen corresponding path program 1 times [2022-11-03 01:35:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809844693] [2022-11-03 01:35:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:35:45,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:45,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809844693] [2022-11-03 01:35:45,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809844693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:35:45,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432822039] [2022-11-03 01:35:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:45,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:45,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:35:45,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:35:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:45,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:35:45,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:35:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:35:45,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:35:45,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432822039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:45,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:35:45,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-03 01:35:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973437205] [2022-11-03 01:35:45,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:45,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:35:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:35:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:35:45,433 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:45,515 INFO L93 Difference]: Finished difference Result 222 states and 314 transitions. [2022-11-03 01:35:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:35:45,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-11-03 01:35:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:45,517 INFO L225 Difference]: With dead ends: 222 [2022-11-03 01:35:45,517 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 01:35:45,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:35:45,519 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:45,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:35:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 01:35:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-03 01:35:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 01:35:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2022-11-03 01:35:45,531 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 57 [2022-11-03 01:35:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:45,532 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2022-11-03 01:35:45,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-11-03 01:35:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 01:35:45,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:45,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:45,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:35:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:45,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 844595874, now seen corresponding path program 1 times [2022-11-03 01:35:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:45,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019836738] [2022-11-03 01:35:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:35:46,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:46,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019836738] [2022-11-03 01:35:46,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019836738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:35:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016529869] [2022-11-03 01:35:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:46,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:46,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:46,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:35:46,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:35:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:46,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 01:35:46,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:35:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:35:46,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:35:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:35:47,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016529869] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:35:47,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:35:47,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 12 [2022-11-03 01:35:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809871506] [2022-11-03 01:35:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:47,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:35:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:35:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:35:47,297 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:47,463 INFO L93 Difference]: Finished difference Result 195 states and 279 transitions. [2022-11-03 01:35:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:35:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-03 01:35:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:47,468 INFO L225 Difference]: With dead ends: 195 [2022-11-03 01:35:47,468 INFO L226 Difference]: Without dead ends: 192 [2022-11-03 01:35:47,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:35:47,471 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 162 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:47,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 218 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:35:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-03 01:35:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 118. [2022-11-03 01:35:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 01:35:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2022-11-03 01:35:47,502 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 59 [2022-11-03 01:35:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:47,503 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2022-11-03 01:35:47,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:35:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2022-11-03 01:35:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-03 01:35:47,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:47,512 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:47,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:35:47,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:47,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash 709182008, now seen corresponding path program 1 times [2022-11-03 01:35:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:47,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763132315] [2022-11-03 01:35:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:47,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:35:48,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763132315] [2022-11-03 01:35:48,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763132315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:35:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550784458] [2022-11-03 01:35:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:48,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:35:48,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:35:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:48,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:35:48,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:35:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:35:48,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:35:48,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550784458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:35:48,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:35:48,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:35:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870102717] [2022-11-03 01:35:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:35:48,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:35:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:35:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:35:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:35:48,867 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:35:48,990 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2022-11-03 01:35:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:35:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-11-03 01:35:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:35:48,993 INFO L225 Difference]: With dead ends: 193 [2022-11-03 01:35:48,993 INFO L226 Difference]: Without dead ends: 186 [2022-11-03 01:35:48,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:35:48,995 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 50 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:35:48,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:35:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-03 01:35:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 119. [2022-11-03 01:35:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 01:35:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2022-11-03 01:35:49,006 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 64 [2022-11-03 01:35:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:35:49,007 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2022-11-03 01:35:49,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-03 01:35:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2022-11-03 01:35:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-03 01:35:49,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:35:49,009 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:35:49,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:35:49,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:49,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:35:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:35:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 162513569, now seen corresponding path program 1 times [2022-11-03 01:35:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:35:49,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475830985] [2022-11-03 01:35:49,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:49,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:35:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:35:49,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:35:49,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475830985] [2022-11-03 01:35:49,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475830985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:35:49,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165994168] [2022-11-03 01:35:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:35:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:35:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:35:49,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:35:49,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:35:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:35:49,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:35:49,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:35:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:35:49,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:35:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 01:35:50,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165994168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:35:50,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [811308285] [2022-11-03 01:35:50,125 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2022-11-03 01:35:50,125 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:35:50,129 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:35:50,135 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:35:50,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:35:50,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:50,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:50,914 INFO L356 Elim1Store]: treesize reduction 364, result has 25.3 percent of original size [2022-11-03 01:35:50,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 59 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 79 treesize of output 181 [2022-11-03 01:35:51,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 68 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 91 [2022-11-03 01:35:51,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:35:51,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:35:51,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-11-03 01:35:51,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 40 [2022-11-03 01:35:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:51,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 68 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-03 01:35:52,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 77 select indices, 77 select index equivalence classes, 698 disjoint index pairs (out of 2926 index pairs), introduced 77 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 232 [2022-11-03 01:35:52,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:52,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 77 select indices, 77 select index equivalence classes, 698 disjoint index pairs (out of 2926 index pairs), introduced 77 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 232 [2022-11-03 01:35:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:53,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:53,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 68 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-03 01:35:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:53,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:53,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 40 [2022-11-03 01:35:53,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:35:53,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:35:53,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:35:53,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:35:53,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:35:53,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:35:54,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 01:35:54,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 01:35:54,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 01:35:54,185 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:35:54,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 103 [2022-11-03 01:35:54,216 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-11-03 01:35:54,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 101 [2022-11-03 01:35:54,244 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:35:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 95 [2022-11-03 01:35:54,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:35:54,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:35:54,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 01:35:54,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:35:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:35:54,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:35:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:35:54,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:35:54,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:35:54,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:36:02,752 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_module_put with input of size 100 for LOIs [2022-11-03 01:36:02,821 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_memset with input of size 297 for LOIs [2022-11-03 01:36:03,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 01:36:03,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:36:03,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:36:03,913 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_init_zalloc with input of size 592 for LOIs [2022-11-03 01:36:05,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:36:05,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,582 INFO L356 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-03 01:36:05,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-03 01:36:05,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:36:05,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:05,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:36:06,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:06,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:36:07,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,274 INFO L356 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-03 01:36:07,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 77 treesize of output 153 [2022-11-03 01:36:07,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:36:07,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:07,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:36:08,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:36:08,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:08,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 91 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 113 [2022-11-03 01:36:09,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:09,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:36:09,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:36:09,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:36:09,212 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 602 for LOIs [2022-11-03 01:36:09,715 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 84 for LOIs [2022-11-03 01:36:09,733 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_error with input of size 77 for LOIs [2022-11-03 01:36:09,740 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:36:18,942 WARN L234 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 592 DAG size of output: 531 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:36:25,069 WARN L234 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 604 DAG size of output: 544 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:36:31,405 WARN L234 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 602 DAG size of output: 542 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:36:38,291 WARN L234 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 603 DAG size of output: 543 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:37:07,357 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3627#(and (<= ~__ksymtab_pppox_ioctl~0.name.offset 0) (<= 6 ~__ksymtab_register_pppox_proto~0.name.base) (= 0 |~#__kstrtab_register_pppox_proto~0.offset|) (= ~LDV_IN_INTERRUPT~0 1) (<= 9 ~__ksymtab_pppox_ioctl~0.name.base) (<= 7 ~__ksymtab_unregister_pppox_proto~0.name.base) (= |~#__kstrtab_register_pppox_proto~0.base| 6) (<= 0 ~__ksymtab_register_pppox_proto~0.name.offset) (<= ~__ksymtab_pppox_ioctl~0.name.base 9) (<= 0 ~__ksymtab_pppox_unbind_sock~0.name.offset) (= 7 |~#__kstrtab_unregister_pppox_proto~0.base|) (= |~#__kstrtab_pppox_ioctl~0.base| 9) (<= ~__ksymtab_unregister_pppox_proto~0.name.offset 0) (not (= ~ldv_module_refcounter~0 1)) (= |~#__kstrtab_pppox_unbind_sock~0.offset| 0) (<= 8 ~__ksymtab_pppox_unbind_sock~0.name.base) (= 5 |~#pppox_protos~0.base|) (= ~ldv_state_variable_0~0 2) (= ~ldv_state_variable_1~0 1) (<= 0 ~__ksymtab_pppox_ioctl~0.name.offset) (= ~ref_cnt~0 0) (<= 0 ~__ksymtab_unregister_pppox_proto~0.name.offset) (<= ~__ksymtab_pppox_unbind_sock~0.name.offset 0) (= |~#__kstrtab_pppox_unbind_sock~0.base| 8) (= |~#pppox_proto_family~0.offset| 0) (= |#NULL.offset| 0) (= |~#pppox_protos~0.offset| 0) (= |~#__kstrtab_unregister_pppox_proto~0.offset| 0) (= ~ldv_retval_0~0 0) (= |~#pppox_proto_family~0.base| 10) (<= ~__ksymtab_unregister_pppox_proto~0.name.base 7) (<= ~__ksymtab_register_pppox_proto~0.name.offset 0) (<= ~__ksymtab_register_pppox_proto~0.name.base 6) (<= ~__ksymtab_pppox_unbind_sock~0.name.base 8) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= |~#__kstrtab_pppox_ioctl~0.offset| 0))' at error location [2022-11-03 01:37:07,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:37:07,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:37:07,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-03 01:37:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784804067] [2022-11-03 01:37:07,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:37:07,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:37:07,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:37:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2565, Unknown=0, NotChecked=0, Total=2756 [2022-11-03 01:37:07,364 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 10 states, 8 states have (on average 6.625) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:37:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:07,733 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2022-11-03 01:37:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:37:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-11-03 01:37:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:07,735 INFO L225 Difference]: With dead ends: 227 [2022-11-03 01:37:07,735 INFO L226 Difference]: Without dead ends: 122 [2022-11-03 01:37:07,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=211, Invalid=2759, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 01:37:07,737 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:07,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:37:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-03 01:37:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-03 01:37:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 01:37:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 168 transitions. [2022-11-03 01:37:07,746 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 168 transitions. Word has length 70 [2022-11-03 01:37:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:07,747 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 168 transitions. [2022-11-03 01:37:07,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 01:37:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 168 transitions. [2022-11-03 01:37:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-03 01:37:07,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:07,749 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:07,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-03 01:37:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:37:07,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -838012263, now seen corresponding path program 2 times [2022-11-03 01:37:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132985650] [2022-11-03 01:37:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 01:37:12,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132985650] [2022-11-03 01:37:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132985650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:12,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637022665] [2022-11-03 01:37:12,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:37:12,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:12,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:12,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:12,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:37:13,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:37:13,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:37:13,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:37:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:13,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:13,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 80 [2022-11-03 01:37:13,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:13,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 59 [2022-11-03 01:37:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-03 01:37:13,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:37:13,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637022665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:13,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:37:13,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19] total 25 [2022-11-03 01:37:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091480578] [2022-11-03 01:37:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:13,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:37:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:13,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:37:13,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:37:13,639 INFO L87 Difference]: Start difference. First operand 122 states and 168 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:37:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:13,965 INFO L93 Difference]: Finished difference Result 268 states and 387 transitions. [2022-11-03 01:37:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:37:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 76 [2022-11-03 01:37:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:13,968 INFO L225 Difference]: With dead ends: 268 [2022-11-03 01:37:13,968 INFO L226 Difference]: Without dead ends: 263 [2022-11-03 01:37:13,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:37:13,969 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 162 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:13,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:37:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-03 01:37:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 196. [2022-11-03 01:37:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 180 states have (on average 1.45) internal successors, (261), 181 states have internal predecessors, (261), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-03 01:37:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 280 transitions. [2022-11-03 01:37:13,987 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 280 transitions. Word has length 76 [2022-11-03 01:37:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 280 transitions. [2022-11-03 01:37:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:37:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 280 transitions. [2022-11-03 01:37:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-03 01:37:13,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:13,989 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:14,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:37:14,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:14,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1209189617, now seen corresponding path program 1 times [2022-11-03 01:37:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137005861] [2022-11-03 01:37:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-03 01:37:14,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:14,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137005861] [2022-11-03 01:37:14,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137005861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:37:14,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:37:14,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 01:37:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854066255] [2022-11-03 01:37:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:37:14,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:37:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:37:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:37:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:37:14,772 INFO L87 Difference]: Start difference. First operand 196 states and 280 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:37:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:37:14,991 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2022-11-03 01:37:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:37:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2022-11-03 01:37:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:37:14,994 INFO L225 Difference]: With dead ends: 356 [2022-11-03 01:37:14,994 INFO L226 Difference]: Without dead ends: 351 [2022-11-03 01:37:14,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:37:14,997 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 111 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:37:14,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 219 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:37:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-03 01:37:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 242. [2022-11-03 01:37:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 222 states have (on average 1.4504504504504505) internal successors, (322), 225 states have internal predecessors, (322), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-03 01:37:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 347 transitions. [2022-11-03 01:37:15,019 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 347 transitions. Word has length 78 [2022-11-03 01:37:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:37:15,020 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 347 transitions. [2022-11-03 01:37:15,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:37:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 347 transitions. [2022-11-03 01:37:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-03 01:37:15,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:37:15,022 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:37:15,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:37:15,022 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:37:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:37:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash 80301855, now seen corresponding path program 1 times [2022-11-03 01:37:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:37:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906460767] [2022-11-03 01:37:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:15,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:37:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 01:37:18,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:37:18,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906460767] [2022-11-03 01:37:18,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906460767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:37:18,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734022376] [2022-11-03 01:37:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:37:18,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:37:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:37:18,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:37:18,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:37:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:37:19,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 01:37:19,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:37:19,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:19,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 80 [2022-11-03 01:37:19,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:19,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 59 [2022-11-03 01:37:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-03 01:37:19,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:37:20,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:20,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 182 [2022-11-03 01:37:20,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:37:20,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-11-03 01:37:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-03 01:37:20,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734022376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:37:20,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1670024540] [2022-11-03 01:37:20,412 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2022-11-03 01:37:20,413 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:37:20,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:37:20,414 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:37:20,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:37:20,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:20,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:20,887 INFO L356 Elim1Store]: treesize reduction 221, result has 34.0 percent of original size [2022-11-03 01:37:20,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 49 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 154 [2022-11-03 01:37:20,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:21,380 INFO L356 Elim1Store]: treesize reduction 364, result has 25.3 percent of original size [2022-11-03 01:37:21,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 59 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 30 case distinctions, treesize of input 79 treesize of output 181 [2022-11-03 01:37:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:37:21,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-11-03 01:37:21,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-11-03 01:37:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 68 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-03 01:37:22,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 77 select indices, 77 select index equivalence classes, 698 disjoint index pairs (out of 2926 index pairs), introduced 77 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 232 [2022-11-03 01:37:22,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 40 [2022-11-03 01:37:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 40 [2022-11-03 01:37:22,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 77 select indices, 77 select index equivalence classes, 698 disjoint index pairs (out of 2926 index pairs), introduced 77 new quantified variables, introduced 0 case distinctions, treesize of input 680 treesize of output 232 [2022-11-03 01:37:22,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:22,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 68 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-03 01:37:23,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:37:23,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:37:23,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:37:23,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:37:23,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:37:23,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-03 01:37:23,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 01:37:23,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 01:37:23,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-11-03 01:37:23,818 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-11-03 01:37:23,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 105 [2022-11-03 01:37:23,846 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:37:23,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 99 [2022-11-03 01:37:23,873 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:37:23,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 95 [2022-11-03 01:37:23,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:37:23,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 01:37:23,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:37:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:37:24,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:37:24,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:37:24,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:37:24,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 6 treesize of output 4 [2022-11-03 01:37:24,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:24,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 19 [2022-11-03 01:37:32,649 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_module_put with input of size 100 for LOIs [2022-11-03 01:37:32,717 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_memset with input of size 297 for LOIs [2022-11-03 01:37:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-11-03 01:37:33,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:37:33,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-11-03 01:37:33,705 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_init_zalloc with input of size 592 for LOIs [2022-11-03 01:37:35,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:37:35,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:37:35,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:37:35,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:35,450 INFO L356 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-11-03 01:37:35,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-11-03 01:37:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:37:36,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:36,886 INFO L356 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-03 01:37:36,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 81 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 20 case distinctions, treesize of input 77 treesize of output 153 [2022-11-03 01:37:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:37,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:37:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:37,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:37:38,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 81 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 01:37:38,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 91 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 113 [2022-11-03 01:37:38,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:37:38,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:37:38,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-03 01:37:38,613 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 602 for LOIs [2022-11-03 01:37:39,109 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 84 for LOIs [2022-11-03 01:37:39,127 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_error with input of size 114 for LOIs [2022-11-03 01:37:39,144 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:37:49,045 WARN L234 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 592 DAG size of output: 531 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:37:55,471 WARN L234 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 604 DAG size of output: 544 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:38:02,115 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 602 DAG size of output: 542 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:38:09,307 WARN L234 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 603 DAG size of output: 543 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:38:40,489 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6313#(and (<= ~__ksymtab_pppox_ioctl~0.name.offset 0) (<= 6 ~__ksymtab_register_pppox_proto~0.name.base) (= ~LDV_IN_INTERRUPT~0 1) (<= |~#pppox_protos~0.base| 5) (<= |~#__kstrtab_unregister_pppox_proto~0.offset| 0) (<= 9 ~__ksymtab_pppox_ioctl~0.name.base) (<= 7 ~__ksymtab_unregister_pppox_proto~0.name.base) (<= 0 |~#__kstrtab_pppox_unbind_sock~0.offset|) (<= 5 |~#pppox_protos~0.base|) (<= 0 ~__ksymtab_register_pppox_proto~0.name.offset) (<= |~#pppox_proto_family~0.offset| 0) (<= ~__ksymtab_pppox_ioctl~0.name.base 9) (<= 10 |~#pppox_proto_family~0.base|) (<= |~#__kstrtab_pppox_unbind_sock~0.base| 8) (<= |~#pppox_proto_family~0.base| 10) (<= 0 ~__ksymtab_pppox_unbind_sock~0.name.offset) (<= 6 |~#__kstrtab_register_pppox_proto~0.base|) (<= ~__ksymtab_unregister_pppox_proto~0.name.offset 0) (<= ~ldv_state_variable_1~0 1) (<= 9 |~#__kstrtab_pppox_ioctl~0.base|) (not (= ~ldv_module_refcounter~0 1)) (<= 0 |~#pppox_protos~0.offset|) (<= 0 |~#__kstrtab_unregister_pppox_proto~0.offset|) (<= |#NULL.offset| 0) (<= |~#__kstrtab_register_pppox_proto~0.base| 6) (<= |~#__kstrtab_pppox_ioctl~0.base| 9) (<= |~#pppox_protos~0.offset| 0) (<= 0 ~ldv_state_variable_1~0) (<= 0 |~#__kstrtab_pppox_ioctl~0.offset|) (<= 8 ~__ksymtab_pppox_unbind_sock~0.name.base) (<= |~#__kstrtab_pppox_unbind_sock~0.offset| 0) (= ~ldv_state_variable_0~0 2) (<= 0 ~__ksymtab_pppox_ioctl~0.name.offset) (<= 8 |~#__kstrtab_pppox_unbind_sock~0.base|) (= ~ref_cnt~0 0) (<= 7 |~#__kstrtab_unregister_pppox_proto~0.base|) (<= 0 ~__ksymtab_unregister_pppox_proto~0.name.offset) (<= |~#__kstrtab_unregister_pppox_proto~0.base| 7) (<= ~__ksymtab_pppox_unbind_sock~0.name.offset 0) (<= |~#__kstrtab_pppox_ioctl~0.offset| 0) (<= 0 |~#pppox_proto_family~0.offset|) (<= |~#__kstrtab_register_pppox_proto~0.offset| 0) (= ~ldv_retval_0~0 0) (<= 0 |#NULL.offset|) (<= ~__ksymtab_unregister_pppox_proto~0.name.base 7) (<= ~__ksymtab_register_pppox_proto~0.name.offset 0) (<= ~__ksymtab_register_pppox_proto~0.name.base 6) (<= ~__ksymtab_pppox_unbind_sock~0.name.base 8) (<= 0 |#StackHeapBarrier|) (<= 0 |~#__kstrtab_register_pppox_proto~0.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:38:40,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:38:40,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:38:40,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 31 [2022-11-03 01:38:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538336691] [2022-11-03 01:38:40,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:38:40,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 01:38:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:38:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 01:38:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=4931, Unknown=0, NotChecked=0, Total=5402 [2022-11-03 01:38:40,494 INFO L87 Difference]: Start difference. First operand 242 states and 347 transitions. Second operand has 31 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2022-11-03 01:38:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:38:41,915 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2022-11-03 01:38:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:38:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 85 [2022-11-03 01:38:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:38:41,916 INFO L225 Difference]: With dead ends: 307 [2022-11-03 01:38:41,916 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:38:41,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=612, Invalid=6030, Unknown=0, NotChecked=0, Total=6642 [2022-11-03 01:38:41,919 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 292 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:38:41,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 520 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:38:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:38:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:38:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:38:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:38:41,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2022-11-03 01:38:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:38:41,921 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:38:41,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 3.925925925925926) internal successors, (106), 28 states have internal predecessors, (106), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2022-11-03 01:38:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:38:41,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:38:41,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:38:41,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:38:42,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:38:42,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:38:42,704 INFO L902 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: true [2022-11-03 01:38:42,704 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2022-11-03 01:38:42,704 INFO L902 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2022-11-03 01:38:42,704 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2022-11-03 01:38:42,704 INFO L899 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2022-11-03 01:38:42,704 INFO L902 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5894 5904) the Hoare annotation is: true [2022-11-03 01:38:42,705 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5857 5859) the Hoare annotation is: true [2022-11-03 01:38:42,705 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2022-11-03 01:38:42,705 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6260 6266) the Hoare annotation is: true [2022-11-03 01:38:42,705 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2022-11-03 01:38:42,705 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2022-11-03 01:38:42,705 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2022-11-03 01:38:42,706 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5929 5935) the Hoare annotation is: true [2022-11-03 01:38:42,706 INFO L895 garLoopResultBuilder]: At program point L6237(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,706 INFO L895 garLoopResultBuilder]: At program point L6204(lines 6204 6209) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,706 INFO L895 garLoopResultBuilder]: At program point L6221(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2022-11-03 01:38:42,706 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2022-11-03 01:38:42,706 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 01:38:42,706 INFO L899 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2022-11-03 01:38:42,706 INFO L902 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2022-11-03 01:38:42,706 INFO L895 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: false [2022-11-03 01:38:42,707 INFO L895 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: false [2022-11-03 01:38:42,707 INFO L899 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2022-11-03 01:38:42,707 INFO L899 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2022-11-03 01:38:42,707 INFO L895 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2022-11-03 01:38:42,707 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,707 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2022-11-03 01:38:42,707 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2022-11-03 01:38:42,707 INFO L895 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,708 INFO L899 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2022-11-03 01:38:42,708 INFO L899 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2022-11-03 01:38:42,708 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2022-11-03 01:38:42,708 INFO L895 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (= |ULTIMATE.start_pppox_create_~protocol#1| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|)) 0) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,708 INFO L895 garLoopResultBuilder]: At program point L6117(lines 6117 6130) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|)) (.cse1 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (and (= ~ldv_module_refcounter~0 1) (= 0 (select .cse0 |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (= |ULTIMATE.start_pppox_create_~protocol#1| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse1) 0) (= 5 |~#pppox_protos~0.base|) (= |ULTIMATE.start_pppox_create_#t~mem51#1.base| (select .cse0 .cse1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |ULTIMATE.start_pppox_create_#t~mem51#1.offset| 0) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|)))) [2022-11-03 01:38:42,708 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2022-11-03 01:38:42,709 INFO L899 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2022-11-03 01:38:42,710 INFO L899 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2022-11-03 01:38:42,710 INFO L899 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2022-11-03 01:38:42,710 INFO L899 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L895 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,711 INFO L902 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L902 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2022-11-03 01:38:42,711 INFO L899 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2022-11-03 01:38:42,712 INFO L895 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,712 INFO L895 garLoopResultBuilder]: At program point L6170-1(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= ~ldv_state_variable_1~0 0) (= 5 |~#pppox_protos~0.base|) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,712 INFO L902 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2022-11-03 01:38:42,712 INFO L899 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2022-11-03 01:38:42,712 INFO L895 garLoopResultBuilder]: At program point L6212(lines 6212 6225) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) |~#pppox_protos~0.offset|)) (= |ULTIMATE.start_main_~#ldvarg2~0#1.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg0~0#1.base|)) (= 5 |~#pppox_protos~0.base|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#ldvarg2~0#1.base|) |ULTIMATE.start_main_~#ldvarg2~0#1.offset|) 0) (= |~#pppox_protos~0.offset| 0) (not (= 5 |ULTIMATE.start_main_~#ldvarg2~0#1.base|))) [2022-11-03 01:38:42,712 INFO L899 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2022-11-03 01:38:42,712 INFO L899 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2022-11-03 01:38:42,712 INFO L899 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2022-11-03 01:38:42,712 INFO L902 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: true [2022-11-03 01:38:42,713 INFO L899 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2022-11-03 01:38:42,713 INFO L902 garLoopResultBuilder]: At program point ldv_module_putENTRY(lines 6331 6344) the Hoare annotation is: true [2022-11-03 01:38:42,713 INFO L899 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2022-11-03 01:38:42,713 INFO L895 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse2 (= |ldv_memset_#Ultimate.C_memset_#ptr#1.offset| 0))) (let ((.cse0 (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| (select |#memory_$Pointer$.base| |ldv_memset_#Ultimate.C_memset_#ptr#1.base|)))) (.cse3 (= |ldv_memset_#in~c#1| (select (select |#memory_int| |ldv_memset_#Ultimate.C_memset_#ptr#1.base|) 0))) (.cse4 (+ |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| |ldv_memset_#Ultimate.C_memset_#ptr#1.offset|)) (.cse6 (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |ldv_memset_#Ultimate.C_memset_#ptr#1.base| (select |#memory_$Pointer$.offset| |ldv_memset_#Ultimate.C_memset_#ptr#1.base|)))) (.cse1 (= |ldv_memset_#Ultimate.C_memset_#ptr#1.base| |ldv_memset_#in~s#1.base|)) (.cse5 (or (= |ldv_memset_#in~s#1.offset| |ldv_memset_#Ultimate.C_memset_#ptr#1.offset|) .cse2)) (.cse7 (= |ldv_memset_#in~n#1| |ldv_memset_#Ultimate.C_memset_#amount#1|))) (or (not (= ~ldv_state_variable_1~0 0)) (and .cse0 .cse1 (or (not .cse2) (and .cse3 (<= 2 .cse4))) .cse5 .cse6) (and .cse0 .cse3 .cse1 (<= 1 .cse4) .cse5 .cse6 (< 0 (mod |ldv_memset_#Ultimate.C_memset_#amount#1| 18446744073709551616)) .cse7) (not (= ~ldv_module_refcounter~0 1)) (and (= |ldv_memset_#Ultimate.C_memset_#t~loopctr92#1| 0) .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse5 (= |ldv_memset_#Ultimate.C_memset_#value#1| |ldv_memset_#in~c#1|) .cse7)))) [2022-11-03 01:38:42,713 INFO L895 garLoopResultBuilder]: At program point ldv_memsetENTRY(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) [2022-11-03 01:38:42,713 INFO L899 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2022-11-03 01:38:42,713 INFO L902 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2022-11-03 01:38:42,713 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:38:42,718 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:38:42,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:38:42,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,755 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,758 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,758 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,759 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,759 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,759 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,759 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,760 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,760 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,761 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,761 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,762 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,762 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,762 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,762 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,762 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,763 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,763 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,764 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,764 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,764 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,765 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,765 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,767 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,767 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,767 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,768 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,768 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,768 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,768 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,769 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,769 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,769 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,770 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,770 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,770 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,771 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,771 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,771 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,771 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,772 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,772 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,772 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,773 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,773 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,773 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,773 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,774 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,774 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,776 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,777 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,779 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,780 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,781 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,782 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,783 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,784 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:38:42 BoogieIcfgContainer [2022-11-03 01:38:42,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:38:42,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:38:42,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:38:42,787 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:38:42,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:35:42" (3/4) ... [2022-11-03 01:38:42,791 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:38:42,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-03 01:38:42,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-03 01:38:42,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2022-11-03 01:38:42,797 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-11-03 01:38:42,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-03 01:38:42,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2022-11-03 01:38:42,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-03 01:38:42,806 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-11-03 01:38:42,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-03 01:38:42,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-03 01:38:42,808 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 01:38:42,833 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_state_variable_1 == 0) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]] && #Ultimate.C_memset_#ptr#1 == s) && (!(#Ultimate.C_memset_#ptr#1 == 0) || (\old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0] && 2 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1))) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]])) || (((((((#memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]] && \old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0]) && #Ultimate.C_memset_#ptr#1 == s) && 1 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]]) && 0 < unknown-#amount-unknown % 18446744073709551616) && \old(n) == unknown-#amount-unknown)) || !(ldv_module_refcounter == 1)) || ((((((aux-#t~loopctr92-aux == 0 && #Ultimate.C_memset_#ptr#1 == s) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && unknown-#value-unknown == \old(c)) && \old(n) == unknown-#amount-unknown) [2022-11-03 01:38:42,876 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:38:42,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:38:42,877 INFO L158 Benchmark]: Toolchain (without parser) took 182488.09ms. Allocated memory was 109.1MB in the beginning and 973.1MB in the end (delta: 864.0MB). Free memory was 40.0MB in the beginning and 764.3MB in the end (delta: -724.2MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,877 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 109.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:38:42,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1416.53ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 39.9MB in the beginning and 67.7MB in the end (delta: -27.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.79ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,878 INFO L158 Benchmark]: Boogie Preprocessor took 45.48ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,878 INFO L158 Benchmark]: RCFGBuilder took 972.70ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 63.3MB in the end (delta: -2.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,878 INFO L158 Benchmark]: TraceAbstraction took 179882.23ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 62.5MB in the beginning and 771.6MB in the end (delta: -709.1MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,879 INFO L158 Benchmark]: Witness Printer took 89.15ms. Allocated memory is still 973.1MB. Free memory was 771.6MB in the beginning and 764.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:38:42,880 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.32ms. Allocated memory is still 109.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1416.53ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 39.9MB in the beginning and 67.7MB in the end (delta: -27.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.79ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 64.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.48ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 972.70ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 63.3MB in the end (delta: -2.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 179882.23ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 62.5MB in the beginning and 771.6MB in the end (delta: -709.1MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 89.15ms. Allocated memory is still 973.1MB. Free memory was 771.6MB in the beginning and 764.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 6264]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.8s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 911 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 911 mSDsluCounter, 2052 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 983 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 703 mSDtfsCounter, 983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 685 SyntacticMatches, 3 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3030 ImplicationChecksByTransitivity, 122.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 325 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 74 PreInvPairs, 111 NumberOfFragments, 590 HoareAnnotationTreeSize, 74 FomulaSimplifications, 673 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 1324 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 4844 SizeOfPredicates, 106 NumberOfNonLiveVariables, 4814 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 589/699 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 1 specifications checked. All of them hold - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant [2022-11-03 01:38:42,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,910 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6252]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant [2022-11-03 01:38:42,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,914 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,915 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,916 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,917 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,918 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,919 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,921 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,922 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,923 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,934 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,934 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,935 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,936 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,937 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,937 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,939 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,939 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,940 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,941 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,942 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,942 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,943 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-03 01:38:42,943 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled Derived loop invariant: (((!(ldv_state_variable_1 == 0) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]] && #Ultimate.C_memset_#ptr#1 == s) && (!(#Ultimate.C_memset_#ptr#1 == 0) || (\old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0] && 2 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1))) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]])) || (((((((#memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]] && \old(c) == unknown-#memory_int-unknown[#Ultimate.C_memset_#ptr#1][0]) && #Ultimate.C_memset_#ptr#1 == s) && 1 <= aux-#t~loopctr92-aux + #Ultimate.C_memset_#ptr#1) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)[#Ultimate.C_memset_#ptr#1 := #memory_$Pointer$[#Ultimate.C_memset_#ptr#1]]) && 0 < unknown-#amount-unknown % 18446744073709551616) && \old(n) == unknown-#amount-unknown)) || !(ldv_module_refcounter == 1)) || ((((((aux-#t~loopctr92-aux == 0 && #Ultimate.C_memset_#ptr#1 == s) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (s == #Ultimate.C_memset_#ptr#1 || #Ultimate.C_memset_#ptr#1 == 0)) && unknown-#value-unknown == \old(c)) && \old(n) == unknown-#amount-unknown) - InvariantResult [Line: 6117]: Loop Invariant [2022-11-03 01:38:42,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,944 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,945 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,946 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,947 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && protocol == 0) && !(5 == ldvarg0)) && #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos] == 0) && 5 == pppox_protos) && pppox_protos[protocol] == #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos]) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos[protocol] == 0) && pppox_protos == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6212]: Loop Invariant [2022-11-03 01:38:42,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,948 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6170]: Loop Invariant [2022-11-03 01:38:42,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && ldv_state_variable_1 == 0) && 5 == pppox_protos) && pppox_protos == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6204]: Loop Invariant [2022-11-03 01:38:42,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && !(5 == ldvarg0)) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && !(5 == ldvarg2) - InvariantResult [Line: 6106]: Loop Invariant [2022-11-03 01:38:42,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 01:38:42,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 01:38:42,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((ldv_module_refcounter == 1 && 0 == #memory_$Pointer$[pppox_protos][pppox_protos]) && ldvarg2 == 0) && protocol == 0) && !(5 == ldvarg0)) && #memory_$Pointer$[pppox_protos][8 * protocol + pppox_protos] == 0) && 5 == pppox_protos) && unknown-#memory_int-unknown[ldvarg2][ldvarg2] == 0) && pppox_protos == 0) && !(5 == ldvarg2) RESULT: Ultimate proved your program to be correct! [2022-11-03 01:38:43,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0499bd0a-1507-48f5-80c8-f0106e3bfab7/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE