./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh --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 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 11:22:31,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:22:31,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:22:31,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:22:31,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:22:31,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:22:31,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:22:31,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:22:31,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:22:31,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:22:31,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:22:31,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:22:31,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:22:31,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:22:31,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:22:31,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:22:31,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:22:31,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:22:31,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:22:31,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:22:31,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:22:31,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:22:31,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:22:31,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:22:31,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:22:31,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:22:31,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:22:31,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:22:31,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:22:31,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:22:31,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:22:31,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:22:31,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:22:31,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:22:31,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:22:31,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:22:31,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:22:31,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:22:31,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:22:31,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:22:31,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:22:31,823 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:22:31,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:22:31,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:22:31,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:22:31,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:22:31,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:22:31,839 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:22:31,839 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:22:31,840 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:22:31,840 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:22:31,840 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:22:31,840 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:22:31,840 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:22:31,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:22:31,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:22:31,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:22:31,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:22:31,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:22:31,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:22:31,843 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_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/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_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-12-14 11:22:32,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:22:32,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:22:32,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:22:32,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:22:32,048 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:22:32,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-14 11:22:34,598 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:22:34,803 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:22:34,803 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-12-14 11:22:34,812 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/data/9d2c0f205/7d9e13775f0f44f6b2ef8bfa02da3f03/FLAGada85908a [2022-12-14 11:22:35,195 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/data/9d2c0f205/7d9e13775f0f44f6b2ef8bfa02da3f03 [2022-12-14 11:22:35,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:22:35,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:22:35,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:22:35,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:22:35,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:22:35,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7750c402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35, skipping insertion in model container [2022-12-14 11:22:35,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:22:35,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:22:35,464 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-14 11:22:35,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:22:35,477 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:22:35,515 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-12-14 11:22:35,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:22:35,536 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:22:35,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35 WrapperNode [2022-12-14 11:22:35,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:22:35,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:22:35,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:22:35,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:22:35,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,574 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-12-14 11:22:35,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:22:35,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:22:35,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:22:35,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:22:35,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:22:35,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:22:35,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:22:35,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:22:35,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (1/1) ... [2022-12-14 11:22:35,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:22:35,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:22:35,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:22:35,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:22:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:22:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:22:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 11:22:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:22:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:22:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:22:35,762 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:22:35,764 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:22:35,940 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:22:36,005 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:22:36,005 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 11:22:36,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:22:36 BoogieIcfgContainer [2022-12-14 11:22:36,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:22:36,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:22:36,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:22:36,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:22:36,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:22:35" (1/3) ... [2022-12-14 11:22:36,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ff1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:22:36, skipping insertion in model container [2022-12-14 11:22:36,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:22:35" (2/3) ... [2022-12-14 11:22:36,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ff1ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:22:36, skipping insertion in model container [2022-12-14 11:22:36,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:22:36" (3/3) ... [2022-12-14 11:22:36,017 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-12-14 11:22:36,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:22:36,036 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:22:36,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:22:36,078 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;@65665630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:22:36,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:22:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 11:22:36,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:36,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:36,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 165599205, now seen corresponding path program 1 times [2022-12-14 11:22:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:36,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557996288] [2022-12-14 11:22:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:22:36,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:36,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557996288] [2022-12-14 11:22:36,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557996288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:22:36,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:22:36,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:22:36,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871338932] [2022-12-14 11:22:36,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:22:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:22:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:22:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:22:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:22:36,408 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:22:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:22:36,464 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2022-12-14 11:22:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:22:36,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 11:22:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:22:36,471 INFO L225 Difference]: With dead ends: 37 [2022-12-14 11:22:36,472 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 11:22:36,474 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-12-14 11:22:36,478 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:22:36,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:22:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 11:22:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-12-14 11:22:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-12-14 11:22:36,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-12-14 11:22:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:22:36,512 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-12-14 11:22:36,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:22:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-12-14 11:22:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 11:22:36,514 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:36,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:22:36,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 523554530, now seen corresponding path program 1 times [2022-12-14 11:22:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:36,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442344777] [2022-12-14 11:22:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:22:36,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:36,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442344777] [2022-12-14 11:22:36,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442344777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:22:36,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:22:36,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:22:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778289028] [2022-12-14 11:22:36,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:22:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:22:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:22:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:22:36,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:22:36,636 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:22:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:22:36,684 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-12-14 11:22:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:22:36,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-12-14 11:22:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:22:36,686 INFO L225 Difference]: With dead ends: 29 [2022-12-14 11:22:36,686 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 11:22:36,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:22:36,688 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:22:36,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:22:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 11:22:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2022-12-14 11:22:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-12-14 11:22:36,695 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2022-12-14 11:22:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:22:36,695 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-12-14 11:22:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:22:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-12-14 11:22:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:22:36,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:36,697 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:36,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:22:36,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 517856597, now seen corresponding path program 1 times [2022-12-14 11:22:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159239888] [2022-12-14 11:22:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:22:36,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159239888] [2022-12-14 11:22:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159239888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:22:36,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:22:36,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:22:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701961050] [2022-12-14 11:22:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:22:36,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:22:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:22:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:22:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:22:36,863 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:22:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:22:36,924 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-12-14 11:22:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:22:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 11:22:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:22:36,925 INFO L225 Difference]: With dead ends: 32 [2022-12-14 11:22:36,925 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 11:22:36,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:22:36,926 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:22:36,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:22:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 11:22:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-12-14 11:22:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-12-14 11:22:36,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2022-12-14 11:22:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:22:36,931 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-12-14 11:22:36,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:22:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-12-14 11:22:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:22:36,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:36,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:22:36,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash 250342324, now seen corresponding path program 1 times [2022-12-14 11:22:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:36,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101786001] [2022-12-14 11:22:36,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 11:22:37,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:37,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101786001] [2022-12-14 11:22:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101786001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:22:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389422071] [2022-12-14 11:22:37,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:37,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:22:37,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:22:37,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:22:37,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:22:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:37,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:22:37,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:22:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 11:22:37,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:22:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 11:22:37,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389422071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:22:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1551918502] [2022-12-14 11:22:37,261 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:22:37,261 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:22:37,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:22:37,270 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:22:37,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:22:37,357 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:37,362 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:37,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:22:37,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:37,819 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-12-14 11:22:37,826 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:37,833 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:37,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:37,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:37,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:37,862 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:37,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:37,866 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:38,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:38,049 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,057 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:38,064 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,075 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,077 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,079 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:38,133 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:22:38,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-12-14 11:22:38,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:38,160 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:22:38,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-12-14 11:22:38,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-12-14 11:22:38,313 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-12-14 11:22:38,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:38,334 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:38,352 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,364 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,366 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,525 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:38,534 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,542 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:38,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:38,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:38,577 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,579 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,581 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,633 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:22:38,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 11:22:38,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 11:22:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,672 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:22:38,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 11:22:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:22:38,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:38,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:38,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:38,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:38,942 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 11:22:38,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 234 [2022-12-14 11:22:38,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:38,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:39,012 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 11:22:39,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 218 [2022-12-14 11:22:41,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:41,849 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:41,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-12-14 11:22:41,875 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:41,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-12-14 11:22:42,160 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 11:22:42,299 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:22:44,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1551918502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:22:44,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:22:44,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 19 [2022-12-14 11:22:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680904603] [2022-12-14 11:22:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:22:44,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 11:22:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:22:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 11:22:44,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-14 11:22:44,666 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:22:45,915 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-12-14 11:22:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 11:22:45,916 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-12-14 11:22:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:22:45,917 INFO L225 Difference]: With dead ends: 33 [2022-12-14 11:22:45,917 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 11:22:45,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-12-14 11:22:45,918 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:22:45,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 24 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 11:22:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 11:22:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2022-12-14 11:22:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-12-14 11:22:45,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 21 [2022-12-14 11:22:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:22:45,929 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-12-14 11:22:45,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-12-14 11:22:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 11:22:45,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:45,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:45,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:22:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:22:46,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -831696074, now seen corresponding path program 1 times [2022-12-14 11:22:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:46,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610601827] [2022-12-14 11:22:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:22:46,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:46,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610601827] [2022-12-14 11:22:46,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610601827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:22:46,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320155152] [2022-12-14 11:22:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:46,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:22:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:22:46,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:22:46,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:22:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:46,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:22:46,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:22:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:22:46,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:22:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:22:46,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320155152] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:22:46,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236444716] [2022-12-14 11:22:46,377 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:22:46,377 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:22:46,377 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:22:46,378 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:22:46,378 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:22:46,391 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,394 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:46,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:46,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:22:46,602 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:46,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:46,618 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:46,633 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,640 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,642 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,643 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,761 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:46,778 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-12-14 11:22:46,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-12-14 11:22:46,796 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:46,810 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,813 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:46,857 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:22:46,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 30 [2022-12-14 11:22:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:46,877 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:22:46,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 34 [2022-12-14 11:22:46,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:46,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2022-12-14 11:22:47,073 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:47,080 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:47,087 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:47,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:47,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:47,105 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,106 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,107 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,108 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:47,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:47,234 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:47,240 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:47,246 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:47,254 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,254 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,255 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 11:22:47,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:22:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,340 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:22:47,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 338 [2022-12-14 11:22:47,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,375 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 11:22:47,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 248 [2022-12-14 11:22:47,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2022-12-14 11:22:47,409 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 11:22:47,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 106 [2022-12-14 11:22:47,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 62 [2022-12-14 11:22:47,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:47,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:22:47,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:47,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,675 INFO L321 Elim1Store]: treesize reduction 74, result has 45.6 percent of original size [2022-12-14 11:22:47,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 237 [2022-12-14 11:22:47,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:47,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:47,743 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-12-14 11:22:47,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 205 [2022-12-14 11:22:49,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:49,428 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:49,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-12-14 11:22:49,446 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:49,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 124 [2022-12-14 11:22:49,761 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 11:22:49,871 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:22:53,074 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '659#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 11:22:53,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:22:53,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:22:53,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-14 11:22:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019717] [2022-12-14 11:22:53,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:22:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:22:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:22:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:22:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-12-14 11:22:53,076 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:22:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:22:53,167 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-12-14 11:22:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 11:22:53,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-12-14 11:22:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:22:53,168 INFO L225 Difference]: With dead ends: 35 [2022-12-14 11:22:53,168 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 11:22:53,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:22:53,168 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:22:53,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 43 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:22:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 11:22:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-12-14 11:22:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:22:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-12-14 11:22:53,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 22 [2022-12-14 11:22:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:22:53,175 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-12-14 11:22:53,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:22:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-12-14 11:22:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:22:53,176 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:22:53,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:22:53,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:22:53,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:22:53,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:22:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:22:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1430491229, now seen corresponding path program 2 times [2022-12-14 11:22:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:22:53,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069310056] [2022-12-14 11:22:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:22:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:22:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:22:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:22:54,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:22:54,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069310056] [2022-12-14 11:22:54,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069310056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:22:54,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202769151] [2022-12-14 11:22:54,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:22:54,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:22:54,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:22:54,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:22:54,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:22:55,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:22:55,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:22:55,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-14 11:22:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:22:55,328 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:55,371 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 11:22:55,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 11:22:55,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 11:22:55,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 11:22:55,433 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-12-14 11:22:55,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 95 [2022-12-14 11:22:55,436 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 69 [2022-12-14 11:22:55,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-12-14 11:22:55,679 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-12-14 11:22:55,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 93 [2022-12-14 11:22:55,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 11:22:55,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-12-14 11:22:55,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:55,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-14 11:22:55,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:55,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2022-12-14 11:22:55,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 11:22:55,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:55,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-12-14 11:22:55,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-12-14 11:22:55,966 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2022-12-14 11:22:56,002 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2022-12-14 11:22:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 11:22:56,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:22:56,194 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_651 Int) (v_ArrVal_650 Int) (v_ArrVal_648 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_648) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_651)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_650)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) .cse3)) (forall ((v_ArrVal_651 Int) (v_ArrVal_650 Int) (v_ArrVal_648 (Array Int Int))) (<= .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_648) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_651)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_650)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1))))) is different from false [2022-12-14 11:22:56,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_651 Int) (v_ArrVal_650 Int) (v_ArrVal_648 (Array Int Int))) (< (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_648) (select (store .cse0 .cse1 v_ArrVal_651) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store .cse2 .cse1 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) .cse3)) (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_651 Int) (v_ArrVal_650 Int) (v_ArrVal_648 (Array Int Int))) (<= .cse3 (+ (let ((.cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_648) (select (store .cse0 .cse4 v_ArrVal_651) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store .cse2 .cse4 v_ArrVal_650) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29|)))))) is different from false [2022-12-14 11:22:56,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-12-14 11:22:56,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2022-12-14 11:22:56,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-12-14 11:22:56,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-12-14 11:22:56,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-12-14 11:22:56,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-14 11:22:56,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-12-14 11:22:56,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:56,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-12-14 11:22:56,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:56,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 11:22:56,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:56,774 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 11:22:56,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 7 [2022-12-14 11:22:56,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_641) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-12-14 11:22:56,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 82 [2022-12-14 11:22:56,872 INFO L321 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2022-12-14 11:22:56,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 91 [2022-12-14 11:22:56,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:22:56,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 58 [2022-12-14 11:22:56,908 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-14 11:22:56,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 10 treesize of output 18 [2022-12-14 11:22:56,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-12-14 11:22:56,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 11:22:56,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 11:22:56,939 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-14 11:22:56,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-12-14 11:22:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202769151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:22:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939743591] [2022-12-14 11:22:57,037 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:22:57,037 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:22:57,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:22:57,037 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:22:57,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:22:57,049 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,051 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:22:57,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:22:57,130 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,142 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:57,147 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,181 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,187 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:57,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,198 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:22:57,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,289 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:22:57,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 343 [2022-12-14 11:22:57,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,316 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 11:22:57,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 248 [2022-12-14 11:22:57,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2022-12-14 11:22:57,440 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,447 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:57,453 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,491 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:22:57,515 INFO L350 Elim1Store]: Elim1 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-12-14 11:22:57,522 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:22:57,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:22:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,614 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 11:22:57,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 339 [2022-12-14 11:22:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,657 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:22:57,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 231 [2022-12-14 11:22:57,697 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:22:57,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 30 [2022-12-14 11:22:57,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 11:22:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2022-12-14 11:22:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:22:57,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:22:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:57,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:22:57,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:22:57,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:22:57,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:57,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:22:58,033 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:58,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-12-14 11:22:58,051 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:22:58,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-12-14 11:22:58,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:22:58,280 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 84 for LOIs [2022-12-14 11:22:58,383 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:23:02,437 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '930#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 11:23:02,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:23:02,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 11:23:02,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2022-12-14 11:23:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488377937] [2022-12-14 11:23:02,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 11:23:02,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 11:23:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 11:23:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2759, Unknown=24, NotChecked=324, Total=3306 [2022-12-14 11:23:02,439 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 32 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:23:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:04,270 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-12-14 11:23:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 11:23:04,271 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-12-14 11:23:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:04,273 INFO L225 Difference]: With dead ends: 51 [2022-12-14 11:23:04,273 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 11:23:04,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=386, Invalid=4149, Unknown=33, NotChecked=402, Total=4970 [2022-12-14 11:23:04,274 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 196 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:04,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 163 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 624 Invalid, 10 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 11:23:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 11:23:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-12-14 11:23:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-12-14 11:23:04,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2022-12-14 11:23:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:04,287 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-12-14 11:23:04,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:23:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-12-14 11:23:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 11:23:04,287 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:04,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:04,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:23:04,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:04,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:04,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:04,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1397928665, now seen corresponding path program 3 times [2022-12-14 11:23:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:04,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008369345] [2022-12-14 11:23:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:23:04,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008369345] [2022-12-14 11:23:04,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008369345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:23:04,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:23:04,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:23:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204732937] [2022-12-14 11:23:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:23:04,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:23:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:04,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:23:04,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:23:04,593 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:23:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:04,664 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-12-14 11:23:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:23:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-14 11:23:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:04,666 INFO L225 Difference]: With dead ends: 42 [2022-12-14 11:23:04,666 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 11:23:04,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:23:04,667 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:04,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:23:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 11:23:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-12-14 11:23:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-12-14 11:23:04,689 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-12-14 11:23:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:04,689 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-12-14 11:23:04,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:23:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-12-14 11:23:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 11:23:04,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:04,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:04,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:23:04,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1597655288, now seen corresponding path program 4 times [2022-12-14 11:23:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:04,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144058256] [2022-12-14 11:23:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:23:04,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144058256] [2022-12-14 11:23:04,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144058256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:23:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866850037] [2022-12-14 11:23:04,780 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 11:23:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:23:04,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:23:04,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:23:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:04,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:23:04,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:23:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:23:04,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:23:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:23:04,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866850037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:23:04,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1242031094] [2022-12-14 11:23:04,963 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:23:04,963 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:23:04,964 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:23:04,964 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:23:04,964 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:23:04,978 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:04,981 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:04,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:04,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:04,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:04,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:04,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:04,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:23:05,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,085 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:05,091 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,099 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,129 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,136 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,157 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:05,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,189 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:23:05,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 11:23:05,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 11:23:05,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,220 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:23:05,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 11:23:05,254 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,261 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,275 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:05,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,314 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:05,321 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:05,347 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:05,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:23:05,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,429 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 11:23:05,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 334 [2022-12-14 11:23:05,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,457 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:23:05,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 231 [2022-12-14 11:23:05,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2022-12-14 11:23:05,507 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:23:05,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 30 [2022-12-14 11:23:05,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 11:23:05,529 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:23:05,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 55 [2022-12-14 11:23:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-12-14 11:23:05,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:05,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:05,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:05,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:05,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:23:05,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:05,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:05,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:05,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:05,833 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:05,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2022-12-14 11:23:05,859 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:05,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 124 [2022-12-14 11:23:06,077 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 84 for LOIs [2022-12-14 11:23:06,168 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:23:09,137 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1422#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_get_data_at_#in~index#1|) (<= |#NULL.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1)) (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 11:23:09,138 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:23:09,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:23:09,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-14 11:23:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347701719] [2022-12-14 11:23:09,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:23:09,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:23:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:23:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:23:09,139 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:23:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:09,278 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-12-14 11:23:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:23:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-12-14 11:23:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:09,279 INFO L225 Difference]: With dead ends: 51 [2022-12-14 11:23:09,279 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 11:23:09,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-12-14 11:23:09,280 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:09,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:23:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 11:23:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-12-14 11:23:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-12-14 11:23:09,294 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 25 [2022-12-14 11:23:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:09,295 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-12-14 11:23:09,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:23:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-12-14 11:23:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 11:23:09,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:09,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:09,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:23:09,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:09,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1370605950, now seen corresponding path program 5 times [2022-12-14 11:23:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:09,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369996387] [2022-12-14 11:23:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 11:23:09,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:09,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369996387] [2022-12-14 11:23:09,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369996387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:23:09,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932547212] [2022-12-14 11:23:09,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:23:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:23:09,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:23:09,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:23:10,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 11:23:10,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:23:10,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:23:10,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:23:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 11:23:10,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:23:10,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932547212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:23:10,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:23:10,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-12-14 11:23:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505242303] [2022-12-14 11:23:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:23:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:23:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:23:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:23:10,566 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:23:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:10,640 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-12-14 11:23:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:23:10,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-12-14 11:23:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:10,641 INFO L225 Difference]: With dead ends: 49 [2022-12-14 11:23:10,641 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 11:23:10,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-14 11:23:10,641 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:10,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:23:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 11:23:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-12-14 11:23:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-12-14 11:23:10,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 25 [2022-12-14 11:23:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:10,654 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-12-14 11:23:10,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 11:23:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-12-14 11:23:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 11:23:10,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:10,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:10,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:23:10,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:10,857 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1052870022, now seen corresponding path program 1 times [2022-12-14 11:23:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126228672] [2022-12-14 11:23:10,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:10,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:23:11,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126228672] [2022-12-14 11:23:11,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126228672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:23:11,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013924076] [2022-12-14 11:23:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:23:11,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:23:11,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:23:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:11,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 11:23:11,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:23:11,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-14 11:23:11,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 11:23:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:23:11,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:23:11,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-12-14 11:23:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:23:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013924076] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:23:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1396114087] [2022-12-14 11:23:11,801 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:23:11,801 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:23:11,801 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:23:11,801 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:23:11,801 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:23:11,814 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:11,816 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:11,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:11,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:23:11,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:11,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:11,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:11,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:11,956 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:11,963 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:11,970 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:12,005 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,012 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,023 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:12,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,056 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:23:12,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 46 treesize of output 36 [2022-12-14 11:23:12,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,072 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 11:23:12,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 46 treesize of output 32 [2022-12-14 11:23:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-14 11:23:12,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2022-12-14 11:23:12,117 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,123 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,129 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:12,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:12,174 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,180 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:12,184 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:12,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:23:12,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,275 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:23:12,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 343 [2022-12-14 11:23:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,296 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 11:23:12,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 248 [2022-12-14 11:23:12,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 13 [2022-12-14 11:23:12,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:12,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:12,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:12,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:12,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:23:12,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:12,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:12,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:12,561 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:12,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-12-14 11:23:12,580 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:12,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-12-14 11:23:12,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:12,949 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 84 for LOIs [2022-12-14 11:23:13,029 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:23:16,336 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2024#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 11:23:16,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:23:16,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:23:16,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 30 [2022-12-14 11:23:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7754410] [2022-12-14 11:23:16,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:23:16,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 11:23:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 11:23:16,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 11:23:16,338 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:23:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:16,953 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-12-14 11:23:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 11:23:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2022-12-14 11:23:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:16,954 INFO L225 Difference]: With dead ends: 48 [2022-12-14 11:23:16,954 INFO L226 Difference]: Without dead ends: 46 [2022-12-14 11:23:16,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 11:23:16,956 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 104 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:16,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 229 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:23:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-14 11:23:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-12-14 11:23:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-12-14 11:23:16,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2022-12-14 11:23:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:16,973 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-12-14 11:23:16,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 29 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:23:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-12-14 11:23:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:23:16,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:16,974 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:16,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:23:17,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 11:23:17,176 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394160, now seen corresponding path program 2 times [2022-12-14 11:23:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:17,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963011295] [2022-12-14 11:23:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:17,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:23:17,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963011295] [2022-12-14 11:23:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963011295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:23:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878502793] [2022-12-14 11:23:17,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:23:17,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:23:17,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:23:17,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 11:23:17,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 11:23:17,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:23:17,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:23:17,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:23:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:23:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:23:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:23:17,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878502793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:23:17,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921430353] [2022-12-14 11:23:17,572 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 11:23:17,572 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:23:17,572 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:23:17,573 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:23:17,573 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:23:17,586 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,590 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-14 11:23:17,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:17,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-12-14 11:23:17,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,701 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:17,709 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,715 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,751 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,767 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:17,774 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-12-14 11:23:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,820 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 11:23:17,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 32 [2022-12-14 11:23:17,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:17,840 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 11:23:17,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 42 treesize of output 28 [2022-12-14 11:23:17,876 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,892 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,907 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:17,935 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:17,942 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-14 11:23:17,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 11:23:17,971 INFO L350 Elim1Store]: Elim1 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-12-14 11:23:18,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 209 [2022-12-14 11:23:18,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,066 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 11:23:18,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 332 treesize of output 334 [2022-12-14 11:23:18,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,101 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 11:23:18,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 236 [2022-12-14 11:23:18,130 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 11:23:18,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 30 [2022-12-14 11:23:18,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-12-14 11:23:18,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2022-12-14 11:23:18,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 11:23:18,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:23:18,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:23:18,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 11:23:18,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:18,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-12-14 11:23:18,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:18,506 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:18,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-12-14 11:23:18,530 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-12-14 11:23:18,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-12-14 11:23:18,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 11:23:18,941 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 80 for LOIs [2022-12-14 11:23:19,047 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:23:21,762 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2379#(and (<= |ULTIMATE.start_dll_circular_get_data_at_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (not (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_dll_circular_get_data_at_#res#1|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|)) |ULTIMATE.start_dll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| 0))' at error location [2022-12-14 11:23:21,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:23:21,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:23:21,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-14 11:23:21,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123029350] [2022-12-14 11:23:21,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:23:21,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 11:23:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:21,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 11:23:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-12-14 11:23:21,763 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:23:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:21,861 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-12-14 11:23:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:23:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-12-14 11:23:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:21,861 INFO L225 Difference]: With dead ends: 45 [2022-12-14 11:23:21,861 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 11:23:21,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2022-12-14 11:23:21,862 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:21,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:23:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 11:23:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 11:23:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:23:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-12-14 11:23:21,870 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 28 [2022-12-14 11:23:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:21,870 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-12-14 11:23:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 11:23:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-12-14 11:23:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:23:21,871 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:23:21,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:23:21,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 11:23:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:22,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:23:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:23:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 139383584, now seen corresponding path program 6 times [2022-12-14 11:23:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:23:22,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941111059] [2022-12-14 11:23:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:23:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:23:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:23:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 11:23:22,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:23:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941111059] [2022-12-14 11:23:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941111059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:23:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936909776] [2022-12-14 11:23:22,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 11:23:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:22,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:23:22,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:23:22,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:23:22,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 11:23:22,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:23:22,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 11:23:22,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:23:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:23:22,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:23:22,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936909776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:23:22,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:23:22,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 11:23:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743226233] [2022-12-14 11:23:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:23:22,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:23:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:23:22,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:23:22,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:23:22,892 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:23:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:23:22,908 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-14 11:23:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:23:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-12-14 11:23:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:23:22,909 INFO L225 Difference]: With dead ends: 28 [2022-12-14 11:23:22,909 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 11:23:22,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:23:22,910 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:23:22,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:23:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 11:23:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 11:23:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 11:23:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 11:23:22,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-12-14 11:23:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:23:22,911 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 11:23:22,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 11:23:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 11:23:22,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 11:23:22,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 11:23:22,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 11:23:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:23:23,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 11:23:26,297 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse0 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_main_~len~0#1|) (<= |#NULL.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse0 4) 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 |#NULL.offset|) (= (select .cse1 0) 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 11:23:26,297 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-12-14 11:23:26,297 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 626 645) the Hoare annotation is: true [2022-12-14 11:23:26,298 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse31 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse33 (select (select |#memory_int| (select .cse23 |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse24 (select .cse23 0))) (let ((.cse0 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (.cse1 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse29 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse10 (not (= .cse24 |ULTIMATE.start_main_~s~0#1.base|))) (.cse11 (not (= .cse24 0))) (.cse30 (<= .cse31 .cse33)) (.cse32 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse12 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse13 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse18 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse20 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse21 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse26 (= |#NULL.base| 0)) (.cse27 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select v_DerPreprocessor_17 4) (select .cse23 4)) (= (select (store (store (store (store |#memory_$Pointer$.base| .cse24 v_DerPreprocessor_16) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_17) .cse24 v_DerPreprocessor_16) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_17) .cse24) (select |#memory_$Pointer$.base| .cse24)))) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse25 .cse26 .cse27) (let ((.cse28 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 8))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse28 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~len~0#1| .cse28) (<= .cse29 |ULTIMATE.start_main_~len~0#1|) .cse11 .cse30 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 8) .cse31) .cse32 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (* |ULTIMATE.start_main_~len~0#1| 2)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse26 .cse27)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| .cse29) (<= .cse33 .cse31) .cse9 .cse10 .cse11 .cse30 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27))))) [2022-12-14 11:23:26,298 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 11:23:26,298 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-12-14 11:23:26,298 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-12-14 11:23:26,298 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse27 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse1 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse2 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse7 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse8 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse27)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse15 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse16 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse17 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse18 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse20 (<= 0 |#StackHeapBarrier|)) (.cse23 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse22 (= |#NULL.base| 0))) (or (let ((.cse5 (select .cse23 8))) (and .cse0 .cse1 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= .cse5 |ULTIMATE.start_main_~len~0#1|) .cse6 (<= |ULTIMATE.start_main_~len~0#1| .cse5) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse21 .cse22)) (let ((.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse26 (select (select |#memory_int| (select .cse24 |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse25 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) .cse4 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) .cse6 (not (= (select .cse24 0) 0)) .cse7 .cse8 .cse9 .cse10 (<= .cse25 .cse26) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= .cse26 .cse25) (= .cse27 (+ 2 (select .cse23 (+ |ULTIMATE.start_main_~s~0#1.offset| 8)))) .cse21 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse22 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))))) [2022-12-14 11:23:26,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-12-14 11:23:26,299 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 11:23:26,299 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-12-14 11:23:26,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 11:23:26,299 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse36 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse38 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_dll_circular_update_at_~index#1|)) (.cse39 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|)) (.cse41 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse34 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse37 (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse40 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|)) (.cse42 (= |ULTIMATE.start_dll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse43 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (.cse45 (= |ULTIMATE.start_dll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|))) (let ((.cse2 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse3 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse4 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse14 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse18 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse20 (or (and .cse34 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse45) (and .cse34 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|)) (= |ULTIMATE.start_dll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_dll_circular_update_at_~index#1| 1)) .cse37 .cse40 .cse42 .cse43 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_dll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse45))) (.cse21 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| .cse36)) (.cse27 (= |#NULL.base| 0)) (.cse33 (select .cse31 0))) (let ((.cse17 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse24 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select v_DerPreprocessor_17 4) (select .cse31 4)) (= (select (store (store (store (store |#memory_$Pointer$.base| .cse33 v_DerPreprocessor_16) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_17) .cse33 v_DerPreprocessor_16) |ULTIMATE.start_main_~s~0#1.base| v_DerPreprocessor_17) .cse33) (select |#memory_$Pointer$.base| .cse33))))) (.cse0 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (.cse29 (let ((.cse35 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse44 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (and .cse34 .cse2 .cse3 .cse35 .cse4 .cse5 .cse7 (< 0 .cse36) .cse11 .cse12 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse14 .cse15 .cse16 .cse43 .cse18 .cse19 (<= |ULTIMATE.start_main_~i~0#1| 1) .cse21 .cse22 .cse23 .cse44 .cse45 .cse27) (and .cse2 .cse3 .cse35 .cse4 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse44 .cse27)))) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse9 (not (= .cse33 0))) (.cse13 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse28 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|))) (or (and .cse0 (= (select .cse1 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse9 (not (= (select .cse10 |ULTIMATE.start_dll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse29 .cse6 .cse8 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse9 (not .cse17) .cse13 .cse24 .cse26 .cse28) (let ((.cse32 (select .cse10 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse30 (+ |ULTIMATE.start_main_~len~0#1| 1))) (and .cse0 .cse29 (= |ULTIMATE.start_main_~i~0#1| 0) .cse6 .cse8 .cse9 (<= .cse30 (select (select |#memory_int| (select .cse31 |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (not (= .cse32 |ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (<= (select (select |#memory_int| .cse32) 8) .cse30) .cse13 .cse26 (= (select .cse1 |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse28)))))) [2022-12-14 11:23:26,299 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-12-14 11:23:26,300 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-12-14 11:23:26,300 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 626 645) the Hoare annotation is: false [2022-12-14 11:23:26,300 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse7 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse8 (= |#NULL.base| 0))) (or (and (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= (select .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) .cse3 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) .cse4 .cse5 .cse6 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) .cse7 (<= 0 |#StackHeapBarrier|) .cse8 (not .cse9)) (let ((.cse10 (select |#memory_int| 1))) (and .cse0 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= 2 (select |#length| 1)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select .cse1 0) 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select .cse1 4) 0) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| 1) 1) .cse3 (= (select .cse2 4) 0) (= (select |#valid| 0) 0) .cse4 (= (select |#valid| 2) 1) .cse5 .cse6 (= (select .cse10 0) 48) (= 27 (select |#length| 2)) .cse9 (= (select .cse2 0) 0) (= (select .cse10 1) 0) .cse7 (< 0 |#StackHeapBarrier|) .cse8)))) [2022-12-14 11:23:26,300 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse43 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse36 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse42 (select (select |#memory_int| (select .cse43 |ULTIMATE.start_main_~s~0#1.offset|)) 8)) (.cse41 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse0 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (.cse1 (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|)) (.cse2 (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|)) (.cse34 (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1)) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) (.cse6 (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse35 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse38 (select (select |#memory_int| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) (+ 8 |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|))) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse9 (not (= (select .cse43 0) 0))) (.cse10 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse37 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse12 (= (+ 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse41)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|)) (.cse15 (<= .cse36 .cse42)) (.cse16 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse18 (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|)) (.cse21 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse22 (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0)) (.cse23 (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2)) (.cse39 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse24 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (.cse25 (<= |ULTIMATE.start_dll_circular_create_~data#1| 1)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse28 (<= .cse42 .cse36)) (.cse40 (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse29 (= .cse41 (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 8))))) (.cse30 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse31 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse32 (= |#NULL.base| 0)) (.cse33 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (and .cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_dll_circular_get_data_at_~index#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse9 .cse10 (= |ULTIMATE.start_dll_circular_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset|) .cse23 .cse24 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| |ULTIMATE.start_dll_circular_get_data_at_#in~head#1.base|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) .cse1 .cse2 .cse34 .cse3 .cse4 .cse6 .cse35 (= |ULTIMATE.start_main_~len~0#1| .cse36) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse37 .cse11 .cse13 .cse14 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_dll_circular_update_at_~data#1|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= .cse38 2) .cse39 .cse24 .cse25 .cse26 .cse40 .cse29 .cse30 .cse32) (and .cse0 .cse1 .cse2 .cse34 .cse3 .cse4 .cse5 .cse6 .cse7 .cse35 (= .cse38 3) .cse8 .cse9 .cse10 .cse37 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse39 .cse24 .cse25 .cse26 .cse27 .cse28 .cse40 .cse29 .cse30 .cse31 (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| 0)) .cse32 .cse33))))) [2022-12-14 11:23:26,301 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-12-14 11:23:26,301 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-12-14 11:23:26,301 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (or (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse1 (not (< 0 |#StackHeapBarrier|))) (.cse2 (not (= |#NULL.base| 0))) (.cse3 (not (= |node_create_#in~data#1| 1)))) (and (let ((.cse4 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) .cse0 .cse1 .cse2 .cse3 (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse4 0) 48)) (not (= (select |old(#valid)| 0) 0)) (not (= (select .cse4 1) 0)))) (or .cse0 .cse1 .cse2 .cse3 (forall ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|)) (.cse6 (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|))) (or (not (= (select .cse5 0) 0)) (not (= (select .cse5 4) 0)) (not (= (select |old(#length)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 12)) (not (= (select .cse6 4) 0)) (not (= (select .cse6 0) 0)) (not (< |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|)) (not (= (select (select |old(#memory_int)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 8) |node_create_#in~data#1|)) (= |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5| 0) (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_5|) 1)))))))) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-12-14 11:23:26,301 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-12-14 11:23:26,304 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2022-12-14 11:23:26,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:23:26,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,322 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,322 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,323 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,341 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,365 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:23:26 BoogieIcfgContainer [2022-12-14 11:23:26,381 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:23:26,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:23:26,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:23:26,382 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:23:26,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:22:36" (3/4) ... [2022-12-14 11:23:26,384 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 11:23:26,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-12-14 11:23:26,393 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-12-14 11:23:26,393 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-12-14 11:23:26,394 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 11:23:26,394 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:23:26,412 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && data == 1) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2022-12-14 11:23:26,413 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && !(#memory_$Pointer$[s][0] == 0)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 + i <= len) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || (((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && len == 2 + i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) && !(head == last)) [2022-12-14 11:23:26,413 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) [2022-12-14 11:23:26,413 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((!(last == 0) && #memory_$Pointer$[head][head] == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && !(#memory_$Pointer$[head][head] == s)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((!(last == 0) && (((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0))) && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && !(head == s)) && len == 2) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && s == 0) && !(head == last))) || ((((((((((((!(last == 0) && (((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0))) && i == 0) && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && len == 2) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last)) [2022-12-14 11:23:26,413 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && 3 == expected) && \old(index) == i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && head == head) && \old(len) <= 2) && len <= 1) && head == head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && len == 2 + i) && 2 == expected) && 0 <= i) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && unknown-#memory_int-unknown[head][8 + head] == 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == 0)) && #NULL == 0) && !(head == last)) [2022-12-14 11:23:26,426 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:23:26,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:23:26,427 INFO L158 Benchmark]: Toolchain (without parser) took 51225.95ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 115.2MB in the beginning and 155.9MB in the end (delta: -40.7MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,427 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 56.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:23:26,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.49ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 97.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.05ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,427 INFO L158 Benchmark]: Boogie Preprocessor took 29.26ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,428 INFO L158 Benchmark]: RCFGBuilder took 403.43ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 73.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,428 INFO L158 Benchmark]: TraceAbstraction took 50370.32ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 72.6MB in the beginning and 160.1MB in the end (delta: -87.5MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,428 INFO L158 Benchmark]: Witness Printer took 44.81ms. Allocated memory is still 264.2MB. Free memory was 160.1MB in the beginning and 155.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 11:23:26,429 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.13ms. Allocated memory is still 117.4MB. Free memory was 56.4MB in the beginning and 56.3MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.49ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 97.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.05ms. Allocated memory is still 151.0MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.26ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.43ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 73.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 50370.32ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 72.6MB in the beginning and 160.1MB in the end (delta: -87.5MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. * Witness Printer took 44.81ms. Allocated memory is still 264.2MB. Free memory was 160.1MB in the beginning and 155.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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$.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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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: 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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: 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$.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: 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: 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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: 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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: 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$.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: 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: 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: 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$.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: 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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$.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: 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$.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$.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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] - 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$.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: 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$.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$.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$.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$.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$.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$.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$.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: 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$.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: 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$.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: 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: 643]: 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 575 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1414 IncrementalHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 132 mSDtfsCounter, 1414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 609 GetRequests, 349 SyntacticMatches, 18 SemanticMatches, 242 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 32 NumberOfFragments, 2560 HoareAnnotationTreeSize, 16 FomulaSimplifications, 1684 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4408 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 479 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 577 ConstructedInterpolants, 3 QuantifiedInterpolants, 2832 SizeOfPredicates, 74 NumberOfNonLiveVariables, 2920 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 228/294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 5.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 16, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 25, TOOLS_POST_TIME: 3.6s, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME: 0.7s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 39, TOOLS_QUANTIFIERELIM_TIME: 4.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 2.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 74, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 8, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 16, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 3.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 3.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 226, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant [2022-12-14 11:23:26,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,437 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,438 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,439 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,440 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,442 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,443 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,447 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,448 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((!(last == 0) && #memory_$Pointer$[head][head] == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && !(#memory_$Pointer$[head][head] == s)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) || ((((((((((!(last == 0) && (((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0))) && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == 0)) && !(head == s)) && len == 2) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && s == 0) && !(head == last))) || ((((((((((((!(last == 0) && (((((((((((((((((((((((((((((\old(data) == data && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && 0 < i + 1) && data == 1) && 1 <= \old(data)) && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && 0 <= \result) && #NULL == 0) && 1 <= data) && s == head) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && \old(data) == new_data) && #NULL == 0) || (((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && data == 1) && 1 <= \old(data)) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && (((((((((\old(data) == data && \old(index) == i) && \old(index) == index) && head == head) && len + i == new_data) && head == head) && head == s) && s == head) && \old(data) == new_data) || ((((((((\old(data) == data && head == #memory_$Pointer$[head][head]) && \old(index) == index + 1) && \old(index) == i) && len + i == new_data) && head == s) && s == head) && #memory_$Pointer$[head][head] == head) && \old(data) == new_data))) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && 0 <= head) && #NULL == 0))) && i == 0) && #memory_$Pointer$[head][head] == 0) && last == #memory_$Pointer$[head][head]) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && !(#memory_$Pointer$[head][s] == head)) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && len == 2) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == last)) - InvariantResult [Line: 635]: Loop Invariant [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,455 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,456 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,457 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((2 <= \old(len) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && i <= 0) && index <= 0) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 631]: Loop Invariant [2022-12-14 11:23:26,458 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,458 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,458 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,460 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,461 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,462 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,464 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_16,QUANTIFIED] [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_17,QUANTIFIED] [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,465 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,466 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,467 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && !(#memory_$Pointer$[s][0] == 0)) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && (\exists v_DerPreprocessor_16 : [int]int, v_DerPreprocessor_17 : [int]int :: v_DerPreprocessor_17[4] == #memory_$Pointer$[s][4] && #memory_$Pointer$[#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0] := v_DerPreprocessor_16][s := v_DerPreprocessor_17][#memory_$Pointer$[s][0]] == #memory_$Pointer$[#memory_$Pointer$[s][0]])) && len == i + 1) && s == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && unknown-#memory_int-unknown[s][8] <= len) && s == head) && len <= unknown-#memory_int-unknown[s][8]) && 2 + i <= len) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][8] <= len + 1) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last))) || (((((((((((((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && len == 2 + i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && !(#memory_$Pointer$[s][0] == 0)) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && index <= 0) && data == 1) && 1 <= \old(data)) && len == 2) && 0 <= \result) && #NULL == 0) && 1 <= data) && \result <= 0) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s == 0) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant [2022-12-14 11:23:26,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,469 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,470 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,471 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(last == 0) && head == 0) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && data == 1) && 1 <= \old(data)) && len == 2) && #NULL == 0) && 1 <= data) && \old(len) <= 2) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((head == 0 && unknown-#length-unknown[head] == 12) && 2 == unknown-#length-unknown[1]) && head == last) && #memory_$Pointer$[head][0] == 0) && data == \old(data)) && unknown-#memory_int-unknown[head][8] == data) && head < unknown-#StackHeapBarrier-unknown) && \valid[head] == 1) && #memory_$Pointer$[head][4] == 0) && 2 == len) && \old(len) == len) && \valid[1] == 1) && data == 1) && #memory_$Pointer$[head][4] == 0) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && 1 <= data) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head == last) && #memory_$Pointer$[head][0] == 0) && unknown-#memory_int-unknown[1][1] == 0) && data <= 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant [2022-12-14 11:23:26,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,472 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,473 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,474 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,475 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,476 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-14 11:23:26,477 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((!(last == 0) && head == 0) && \old(index) == index) && 2 <= \old(len)) && 1 <= len) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && s == head) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && 3 == expected) && \old(index) == i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && head == head) && \old(len) <= 2) && len <= 1) && head == head) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && #NULL == 0) && !(head == last)) || (((((((((((((((((((((((((((((((head == 0 && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && last <= 0) && index <= 0) && len == 2 + i) && 2 == expected) && 0 <= i) && index <= 0) && data == 1) && 1 <= \old(data)) && len + i == data) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && unknown-#memory_int-unknown[head][8 + head] == 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((!(last == 0) && 2 <= \old(len)) && 1 <= len) && head <= 0) && 0 <= last) && \old(data) <= 1) && #memory_$Pointer$[head][head] == 0) && last <= 0) && last == #memory_$Pointer$[head][head]) && index <= 0) && unknown-#memory_int-unknown[head][8 + head] == 3) && s == head) && !(#memory_$Pointer$[s][0] == 0)) && 3 == expected) && 0 <= i) && index <= 0) && 2 + data == len * 2) && data == 1) && 1 <= \old(data)) && 2 + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8]) && len == 2) && head == 0) && 0 <= \result) && #NULL == 0) && 1 <= data) && head == s) && \result <= 0) && \old(len) <= 2) && i <= 1) && len <= 1) && data <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= 2 + i) && 0 <= head) && len * 2 == 2 + unknown-#memory_int-unknown[s][s + 8]) && s == 0) && #memory_$Pointer$[head][s] == 0) && !(head == 0)) && #NULL == 0) && !(head == last)) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 11:23:26,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0024b61f-93f3-4750-a0f6-afe42216d922/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE