./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- 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-e04fb08 [2022-11-16 11:34:44,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:34:44,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:34:44,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:34:44,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:34:44,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:34:44,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:34:44,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:34:44,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:34:44,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:34:44,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:34:44,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:34:44,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:34:44,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:34:44,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:34:44,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:34:44,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:34:44,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:34:44,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:34:44,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:34:44,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:34:44,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:34:44,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:34:44,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:34:44,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:34:44,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:34:44,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:34:44,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:34:44,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:34:44,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:34:44,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:34:44,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:34:44,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:34:44,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:34:44,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:34:44,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:34:44,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:34:44,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:34:44,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:34:44,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:34:44,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:34:44,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:34:44,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:34:44,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:34:44,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:34:44,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:34:44,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:34:44,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:34:44,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:34:44,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:34:44,781 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:34:44,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:34:44,782 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:34:44,783 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:34:44,783 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:34:44,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:34:44,783 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:34:44,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:34:44,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:34:44,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:34:44,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:34:44,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:34:44,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:44,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:34:44,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:34:44,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:34:44,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:34:44,785 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_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/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_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-11-16 11:34:45,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:34:45,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:34:45,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:34:45,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:34:45,112 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:34:45,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-16 11:34:45,211 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/data/c3ee8ee47/bb1a886ab1c546d399e00c01d31d91c2/FLAG03dbbe181 [2022-11-16 11:34:45,782 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:34:45,783 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-11-16 11:34:45,794 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/data/c3ee8ee47/bb1a886ab1c546d399e00c01d31d91c2/FLAG03dbbe181 [2022-11-16 11:34:46,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/data/c3ee8ee47/bb1a886ab1c546d399e00c01d31d91c2 [2022-11-16 11:34:46,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:34:46,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:34:46,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:46,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:34:46,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:34:46,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e16a3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46, skipping insertion in model container [2022-11-16 11:34:46,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:34:46,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:34:46,488 WARN L229 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_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-16 11:34:46,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:46,500 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:34:46,549 WARN L229 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_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2022-11-16 11:34:46,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:46,575 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:34:46,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46 WrapperNode [2022-11-16 11:34:46,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:46,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:46,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:34:46,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:34:46,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,627 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-16 11:34:46,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:46,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:34:46,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:34:46,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:34:46,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,656 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:34:46,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:34:46,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:34:46,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:34:46,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (1/1) ... [2022-11-16 11:34:46,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:46,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:34:46,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:34:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:34:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:34:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:34:46,776 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:34:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:34:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:34:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:34:46,912 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:34:46,915 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:34:47,454 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:34:47,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:34:47,469 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:34:47,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:47 BoogieIcfgContainer [2022-11-16 11:34:47,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:34:47,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:34:47,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:34:47,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:34:47,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:34:46" (1/3) ... [2022-11-16 11:34:47,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de80bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:47, skipping insertion in model container [2022-11-16 11:34:47,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:46" (2/3) ... [2022-11-16 11:34:47,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de80bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:47, skipping insertion in model container [2022-11-16 11:34:47,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:47" (3/3) ... [2022-11-16 11:34:47,486 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-11-16 11:34:47,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:34:47,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-16 11:34:47,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:34:47,605 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6ca7ef89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:34:47,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 11:34:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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-11-16 11:34:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:34:47,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:47,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:34:47,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2022-11-16 11:34:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553568706] [2022-11-16 11:34:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553568706] [2022-11-16 11:34:47,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553568706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:47,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:47,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:34:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303882396] [2022-11-16 11:34:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:47,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:47,991 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:34:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:48,155 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-11-16 11:34:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:34:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:48,171 INFO L225 Difference]: With dead ends: 135 [2022-11-16 11:34:48,172 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 11:34:48,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:48,181 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:34:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 11:34:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-16 11:34:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 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-11-16 11:34:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2022-11-16 11:34:48,327 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2022-11-16 11:34:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:48,327 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2022-11-16 11:34:48,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:34:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-11-16 11:34:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:34:48,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:48,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:34:48,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:34:48,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2022-11-16 11:34:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863326795] [2022-11-16 11:34:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:48,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863326795] [2022-11-16 11:34:48,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863326795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:48,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:48,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:34:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011245757] [2022-11-16 11:34:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:48,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:34:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:34:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:48,535 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:34:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:48,682 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-16 11:34:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:34:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:34:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:48,684 INFO L225 Difference]: With dead ends: 129 [2022-11-16 11:34:48,685 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 11:34:48,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:34:48,687 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:48,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:34:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 11:34:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-16 11:34:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 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-11-16 11:34:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-16 11:34:48,700 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2022-11-16 11:34:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:48,700 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-16 11:34:48,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:34:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-16 11:34:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:34:48,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:48,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:48,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:34:48,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2022-11-16 11:34:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:48,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331216828] [2022-11-16 11:34:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:48,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331216828] [2022-11-16 11:34:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331216828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:48,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:48,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:34:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518588967] [2022-11-16 11:34:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:48,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:34:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:34:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:48,924 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-16 11:34:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:49,132 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-16 11:34:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:34:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-11-16 11:34:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:49,134 INFO L225 Difference]: With dead ends: 140 [2022-11-16 11:34:49,135 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 11:34:49,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:49,136 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:49,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:34:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 11:34:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-11-16 11:34:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 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-11-16 11:34:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-11-16 11:34:49,149 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2022-11-16 11:34:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:49,150 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-11-16 11:34:49,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-16 11:34:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-11-16 11:34:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:34:49,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:49,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:49,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:34:49,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2022-11-16 11:34:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:49,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113545162] [2022-11-16 11:34:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:34:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113545162] [2022-11-16 11:34:49,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113545162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:49,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:49,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:34:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23405598] [2022-11-16 11:34:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:49,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:34:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:34:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:34:49,452 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:34:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:49,842 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-11-16 11:34:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-16 11:34:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:49,846 INFO L225 Difference]: With dead ends: 130 [2022-11-16 11:34:49,848 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 11:34:49,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:49,850 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:49,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 11:34:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-16 11:34:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 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-11-16 11:34:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-11-16 11:34:49,860 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2022-11-16 11:34:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:49,861 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-11-16 11:34:49,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:34:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-11-16 11:34:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:34:49,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:49,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:34:49,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2022-11-16 11:34:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486282543] [2022-11-16 11:34:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:50,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486282543] [2022-11-16 11:34:50,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486282543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:50,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:50,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:34:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625151317] [2022-11-16 11:34:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:50,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:34:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:34:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:34:50,190 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:34:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:50,603 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-16 11:34:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-16 11:34:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:50,606 INFO L225 Difference]: With dead ends: 129 [2022-11-16 11:34:50,607 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 11:34:50,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:50,609 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:50,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:34:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 11:34:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-16 11:34:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 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-11-16 11:34:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2022-11-16 11:34:50,631 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2022-11-16 11:34:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:50,635 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2022-11-16 11:34:50,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:34:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2022-11-16 11:34:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:34:50,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:50,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:50,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:34:50,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2022-11-16 11:34:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51025908] [2022-11-16 11:34:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:51,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51025908] [2022-11-16 11:34:51,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51025908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:51,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220061073] [2022-11-16 11:34:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:51,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:51,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:51,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:51,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:34:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:51,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:34:51,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:51,335 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 6 treesize of output 5 [2022-11-16 11:34:51,433 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:34:51,587 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:34:51,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:34:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:34:51,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:51,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220061073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:51,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:34:51,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-16 11:34:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849681289] [2022-11-16 11:34:51,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:51,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:34:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:51,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:34:51,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-16 11:34:51,715 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:34:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:52,131 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-16 11:34:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-16 11:34:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:52,133 INFO L225 Difference]: With dead ends: 135 [2022-11-16 11:34:52,133 INFO L226 Difference]: Without dead ends: 135 [2022-11-16 11:34:52,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-16 11:34:52,135 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:52,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 495 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 153 Unchecked, 0.3s Time] [2022-11-16 11:34:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-16 11:34:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-16 11:34:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:34:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-16 11:34:52,147 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2022-11-16 11:34:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:52,147 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-16 11:34:52,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:34:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-16 11:34:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:34:52,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:52,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:52,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:52,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:52,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2022-11-16 11:34:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:52,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679384313] [2022-11-16 11:34:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679384313] [2022-11-16 11:34:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679384313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783683735] [2022-11-16 11:34:52,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:52,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:52,938 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:52,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:34:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:53,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 11:34:53,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:53,096 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 6 treesize of output 5 [2022-11-16 11:34:53,471 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:34:53,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-16 11:34:53,493 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:34:53,493 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-11-16 11:34:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:34:53,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:55,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783683735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:55,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:34:55,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-11-16 11:34:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450100526] [2022-11-16 11:34:55,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:34:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:34:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:34:55,778 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:34:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:56,778 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-16 11:34:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:34:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-16 11:34:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:56,780 INFO L225 Difference]: With dead ends: 135 [2022-11-16 11:34:56,780 INFO L226 Difference]: Without dead ends: 135 [2022-11-16 11:34:56,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:34:56,782 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:56,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 853 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 713 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2022-11-16 11:34:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-16 11:34:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-16 11:34:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:34:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-16 11:34:56,789 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2022-11-16 11:34:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:56,789 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-16 11:34:56,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 11:34:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-16 11:34:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:34:56,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:56,791 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-11-16 11:34:56,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:56,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:34:56,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2022-11-16 11:34:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:56,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019055375] [2022-11-16 11:34:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:57,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:57,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:57,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019055375] [2022-11-16 11:34:57,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019055375] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:57,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806797079] [2022-11-16 11:34:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:57,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:57,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:57,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:57,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:34:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:57,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:34:57,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:57,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:57,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806797079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:34:57,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:34:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-16 11:34:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080906982] [2022-11-16 11:34:57,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:57,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:34:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:34:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:34:57,582 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:34:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:57,874 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-11-16 11:34:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-16 11:34:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:57,876 INFO L225 Difference]: With dead ends: 134 [2022-11-16 11:34:57,876 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 11:34:57,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:57,877 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:57,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 11:34:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-11-16 11:34:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:34:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-11-16 11:34:57,882 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2022-11-16 11:34:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-11-16 11:34:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:34:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-11-16 11:34:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:34:57,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:57,883 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, 1] [2022-11-16 11:34:57,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:58,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 11:34:58,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2022-11-16 11:34:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:58,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886200594] [2022-11-16 11:34:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:34:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886200594] [2022-11-16 11:34:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886200594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108060313] [2022-11-16 11:34:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:58,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:58,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:58,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:34:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:58,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:34:58,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:34:58,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:58,514 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:34:58,514 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 12 treesize of output 11 [2022-11-16 11:34:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:34:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108060313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:34:58,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:34:58,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-16 11:34:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927993085] [2022-11-16 11:34:58,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:34:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:34:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:34:58,549 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:34:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:58,840 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2022-11-16 11:34:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-16 11:34:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:58,842 INFO L225 Difference]: With dead ends: 138 [2022-11-16 11:34:58,842 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:34:58,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:58,843 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 12 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:58,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 429 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:34:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:34:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-11-16 11:34:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:34:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2022-11-16 11:34:58,848 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2022-11-16 11:34:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:58,848 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2022-11-16 11:34:58,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:34:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2022-11-16 11:34:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:34:58,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:58,850 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, 1] [2022-11-16 11:34:58,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:34:59,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:59,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:34:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2022-11-16 11:34:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:59,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212054755] [2022-11-16 11:34:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:34:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:59,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212054755] [2022-11-16 11:34:59,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212054755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879086774] [2022-11-16 11:34:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:59,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:59,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:59,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:34:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:59,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:34:59,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:59,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:59,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:34:59,792 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 20 treesize of output 24 [2022-11-16 11:34:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:34:59,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879086774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:34:59,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:34:59,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-16 11:34:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688750627] [2022-11-16 11:34:59,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:34:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:34:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:34:59,985 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-16 11:35:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:00,444 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-11-16 11:35:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:35:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-16 11:35:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:00,445 INFO L225 Difference]: With dead ends: 143 [2022-11-16 11:35:00,446 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 11:35:00,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:35:00,447 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 28 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:00,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1226 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:35:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 11:35:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2022-11-16 11:35:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:35:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2022-11-16 11:35:00,452 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2022-11-16 11:35:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:00,452 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2022-11-16 11:35:00,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-16 11:35:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-11-16 11:35:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:35:00,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:00,453 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, 1, 1] [2022-11-16 11:35:00,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:00,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:00,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2022-11-16 11:35:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:00,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065770794] [2022-11-16 11:35:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:00,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:00,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065770794] [2022-11-16 11:35:00,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065770794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:00,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:00,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:35:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514729328] [2022-11-16 11:35:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:00,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:35:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:00,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:35:00,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:35:00,856 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:35:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:01,269 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-16 11:35:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:35:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-16 11:35:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:01,274 INFO L225 Difference]: With dead ends: 136 [2022-11-16 11:35:01,274 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 11:35:01,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:35:01,275 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:01,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:35:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 11:35:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-11-16 11:35:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:35:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-11-16 11:35:01,280 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2022-11-16 11:35:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:01,280 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-11-16 11:35:01,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:35:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-11-16 11:35:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:35:01,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:01,282 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, 1, 1] [2022-11-16 11:35:01,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:35:01,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2022-11-16 11:35:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:01,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184331488] [2022-11-16 11:35:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:35:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:01,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184331488] [2022-11-16 11:35:01,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184331488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:01,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:01,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:35:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786277983] [2022-11-16 11:35:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:35:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:35:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:35:01,666 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:35:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:02,072 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-11-16 11:35:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:35:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-16 11:35:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:02,074 INFO L225 Difference]: With dead ends: 134 [2022-11-16 11:35:02,074 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 11:35:02,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:35:02,074 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:02,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:35:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 11:35:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-16 11:35:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-16 11:35:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-11-16 11:35:02,079 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2022-11-16 11:35:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:02,079 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-11-16 11:35:02,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 11:35:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-11-16 11:35:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:35:02,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:02,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:02,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:35:02,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2022-11-16 11:35:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:02,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169098155] [2022-11-16 11:35:02,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:35:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:35:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:02,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169098155] [2022-11-16 11:35:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169098155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856467090] [2022-11-16 11:35:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:02,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:02,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:35:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:02,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:35:02,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:35:02,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:35:02,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856467090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:02,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:35:02,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 11:35:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743739492] [2022-11-16 11:35:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:35:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:35:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:02,528 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-16 11:35:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:02,562 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-16 11:35:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:35:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2022-11-16 11:35:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:02,564 INFO L225 Difference]: With dead ends: 122 [2022-11-16 11:35:02,564 INFO L226 Difference]: Without dead ends: 122 [2022-11-16 11:35:02,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:02,566 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 214 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:02,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:35:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-16 11:35:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-16 11:35:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 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-11-16 11:35:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2022-11-16 11:35:02,574 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2022-11-16 11:35:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:02,574 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2022-11-16 11:35:02,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-11-16 11:35:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-11-16 11:35:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:35:02,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:02,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:02,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:02,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:35:02,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2022-11-16 11:35:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:02,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061978299] [2022-11-16 11:35:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:35:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:03,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061978299] [2022-11-16 11:35:03,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061978299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:03,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266188152] [2022-11-16 11:35:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:03,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:03,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:35:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:03,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 11:35:03,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:03,619 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 6 treesize of output 5 [2022-11-16 11:35:03,633 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 5 treesize of output 3 [2022-11-16 11:35:03,656 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2022-11-16 11:35:03,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:03,722 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 14 [2022-11-16 11:35:03,746 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 5 treesize of output 3 [2022-11-16 11:35:03,753 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-16 11:35:03,785 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:35:03,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 11:35:03,876 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 5 treesize of output 3 [2022-11-16 11:35:03,889 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))))) is different from true [2022-11-16 11:35:03,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:03,948 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 14 [2022-11-16 11:35:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-16 11:35:03,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266188152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:04,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-16 11:35:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371829170] [2022-11-16 11:35:04,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:35:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:35:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2022-11-16 11:35:04,030 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:35:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:04,766 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-11-16 11:35:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:35:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-16 11:35:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:04,768 INFO L225 Difference]: With dead ends: 133 [2022-11-16 11:35:04,768 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 11:35:04,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=218, Unknown=3, NotChecked=96, Total=380 [2022-11-16 11:35:04,769 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 143 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:04,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 508 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 590 Invalid, 0 Unknown, 401 Unchecked, 0.5s Time] [2022-11-16 11:35:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 11:35:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-11-16 11:35:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 110 states have internal predecessors, (116), 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-11-16 11:35:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2022-11-16 11:35:04,773 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 43 [2022-11-16 11:35:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:04,774 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2022-11-16 11:35:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:35:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-11-16 11:35:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:35:04,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:04,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:04,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:04,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:35:04,983 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2022-11-16 11:35:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:04,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223095059] [2022-11-16 11:35:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:04,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:05,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:35:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223095059] [2022-11-16 11:35:05,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223095059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:05,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136848028] [2022-11-16 11:35:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:05,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:05,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:05,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:35:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:06,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:35:06,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:06,012 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 6 treesize of output 5 [2022-11-16 11:35:06,029 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 5 treesize of output 3 [2022-11-16 11:35:06,051 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 11:35:06,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:06,111 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 14 [2022-11-16 11:35:06,145 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 5 treesize of output 3 [2022-11-16 11:35:06,154 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-11-16 11:35:06,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:06,202 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 14 [2022-11-16 11:35:06,311 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 5 treesize of output 3 [2022-11-16 11:35:06,324 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 11:35:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:06,379 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 14 [2022-11-16 11:35:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-16 11:35:06,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136848028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:08,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:08,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-16 11:35:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821724436] [2022-11-16 11:35:08,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:08,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:35:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:35:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-16 11:35:08,517 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:35:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:09,094 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-16 11:35:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:35:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-16 11:35:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:09,096 INFO L225 Difference]: With dead ends: 125 [2022-11-16 11:35:09,096 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 11:35:09,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-16 11:35:09,097 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 270 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 259 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 421 Invalid, 0 Unknown, 378 Unchecked, 0.5s Time] [2022-11-16 11:35:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 11:35:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-16 11:35:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 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-11-16 11:35:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-11-16 11:35:09,100 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 43 [2022-11-16 11:35:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:09,100 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-11-16 11:35:09,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 11:35:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-11-16 11:35:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:35:09,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:09,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:09,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:35:09,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2022-11-16 11:35:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180321542] [2022-11-16 11:35:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:35:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:09,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180321542] [2022-11-16 11:35:09,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180321542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:09,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:09,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:35:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582627406] [2022-11-16 11:35:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:09,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:35:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:09,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:35:09,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:35:09,491 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:35:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:09,737 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-16 11:35:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:35:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-11-16 11:35:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:09,738 INFO L225 Difference]: With dead ends: 121 [2022-11-16 11:35:09,738 INFO L226 Difference]: Without dead ends: 121 [2022-11-16 11:35:09,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:35:09,739 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 79 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:09,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 282 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:35:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-16 11:35:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-11-16 11:35:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 98 states have internal predecessors, (104), 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-11-16 11:35:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-16 11:35:09,742 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2022-11-16 11:35:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:09,742 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-16 11:35:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:35:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-16 11:35:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:35:09,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:09,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:35:09,747 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2022-11-16 11:35:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910819653] [2022-11-16 11:35:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:35:10,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910819653] [2022-11-16 11:35:10,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910819653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:10,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:10,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:35:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098862183] [2022-11-16 11:35:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:10,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:35:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:35:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:35:10,095 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:35:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:10,332 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-11-16 11:35:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:35:10,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-11-16 11:35:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:10,334 INFO L225 Difference]: With dead ends: 99 [2022-11-16 11:35:10,334 INFO L226 Difference]: Without dead ends: 99 [2022-11-16 11:35:10,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:35:10,335 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:10,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 297 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:35:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-16 11:35:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-16 11:35:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 94 states have internal predecessors, (100), 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-11-16 11:35:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-11-16 11:35:10,338 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2022-11-16 11:35:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:10,339 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-11-16 11:35:10,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:35:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-11-16 11:35:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:35:10,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:10,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:10,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:35:10,340 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2022-11-16 11:35:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833549970] [2022-11-16 11:35:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:35:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833549970] [2022-11-16 11:35:11,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833549970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:11,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382418120] [2022-11-16 11:35:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:11,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:11,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:11,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:35:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:11,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:35:11,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:11,551 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 6 treesize of output 5 [2022-11-16 11:35:11,785 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 9 treesize of output 5 [2022-11-16 11:35:11,964 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2355 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2355))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 11:35:11,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:11,995 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 16 treesize of output 18 [2022-11-16 11:35:12,011 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:35:12,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-16 11:35:12,118 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 17 treesize of output 9 [2022-11-16 11:35:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:35:12,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:12,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_2361 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_48| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_2361) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 1))) is different from false [2022-11-16 11:35:12,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382418120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:12,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:12,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-16 11:35:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255615596] [2022-11-16 11:35:12,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:35:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:12,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:35:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2022-11-16 11:35:12,219 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:13,062 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2022-11-16 11:35:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:35:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-16 11:35:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:13,063 INFO L225 Difference]: With dead ends: 98 [2022-11-16 11:35:13,063 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 11:35:13,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=862, Unknown=5, NotChecked=122, Total=1122 [2022-11-16 11:35:13,065 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:13,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 562 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 454 Invalid, 0 Unknown, 154 Unchecked, 0.5s Time] [2022-11-16 11:35:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 11:35:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 11:35:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 93 states have internal predecessors, (99), 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-11-16 11:35:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-16 11:35:13,068 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 46 [2022-11-16 11:35:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:13,068 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-16 11:35:13,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-16 11:35:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:35:13,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:13,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:13,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:13,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:35:13,270 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2022-11-16 11:35:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:13,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757167718] [2022-11-16 11:35:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757167718] [2022-11-16 11:35:15,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757167718] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097926163] [2022-11-16 11:35:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:15,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:15,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:35:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:15,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-16 11:35:15,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:15,447 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 6 treesize of output 5 [2022-11-16 11:35:15,941 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 11 [2022-11-16 11:35:15,947 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 7 treesize of output 3 [2022-11-16 11:35:16,173 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2601 (Array Int Int)) (v_ArrVal_2600 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2600)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2601) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:35:16,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:16,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 11:35:16,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:16,235 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 14 treesize of output 16 [2022-11-16 11:35:16,248 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:35:16,249 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 15 treesize of output 15 [2022-11-16 11:35:16,255 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 18 treesize of output 13 [2022-11-16 11:35:16,331 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 15 treesize of output 7 [2022-11-16 11:35:16,336 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 17 treesize of output 9 [2022-11-16 11:35:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:35:16,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:17,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097926163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:17,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:17,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-11-16 11:35:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327827139] [2022-11-16 11:35:17,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:17,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:35:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:35:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2022-11-16 11:35:17,485 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:19,314 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-16 11:35:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:35:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-16 11:35:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:19,316 INFO L225 Difference]: With dead ends: 97 [2022-11-16 11:35:19,316 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 11:35:19,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=198, Invalid=1527, Unknown=1, NotChecked=80, Total=1806 [2022-11-16 11:35:19,317 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 210 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:19,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 788 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1114 Invalid, 0 Unknown, 101 Unchecked, 1.2s Time] [2022-11-16 11:35:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 11:35:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-16 11:35:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 92 states have internal predecessors, (98), 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-11-16 11:35:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-11-16 11:35:19,321 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2022-11-16 11:35:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:19,321 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-11-16 11:35:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-11-16 11:35:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:35:19,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:19,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:19,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:19,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:19,530 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:19,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869774, now seen corresponding path program 1 times [2022-11-16 11:35:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:19,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368124353] [2022-11-16 11:35:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368124353] [2022-11-16 11:35:21,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368124353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206880439] [2022-11-16 11:35:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:21,862 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:21,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:35:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:22,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 11:35:22,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:22,208 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 6 treesize of output 5 [2022-11-16 11:35:22,515 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-11-16 11:35:22,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:22,724 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-11-16 11:35:22,730 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 18 treesize of output 14 [2022-11-16 11:35:22,744 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:35:22,744 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 7 [2022-11-16 11:35:22,972 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2856 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2855 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2855) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:35:23,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:23,038 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:35:23,038 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2022-11-16 11:35:23,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:23,051 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 26 treesize of output 28 [2022-11-16 11:35:23,087 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-16 11:35:23,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2022-11-16 11:35:23,193 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 27 treesize of output 19 [2022-11-16 11:35:23,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:23,276 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-16 11:35:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:35:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:23,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206880439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:23,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2022-11-16 11:35:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824197427] [2022-11-16 11:35:23,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:23,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:35:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:23,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:35:23,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-11-16 11:35:23,587 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:35:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:25,954 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2022-11-16 11:35:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:35:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-11-16 11:35:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:25,957 INFO L225 Difference]: With dead ends: 181 [2022-11-16 11:35:25,957 INFO L226 Difference]: Without dead ends: 181 [2022-11-16 11:35:25,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=278, Invalid=2175, Unknown=1, NotChecked=96, Total=2550 [2022-11-16 11:35:25,959 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 512 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:25,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1301 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1433 Invalid, 0 Unknown, 235 Unchecked, 1.4s Time] [2022-11-16 11:35:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-16 11:35:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 96. [2022-11-16 11:35:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 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-11-16 11:35:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-16 11:35:25,964 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 48 [2022-11-16 11:35:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:25,964 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-16 11:35:25,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:35:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-16 11:35:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:35:25,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:25,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:25,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:26,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:26,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869775, now seen corresponding path program 1 times [2022-11-16 11:35:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:26,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609772687] [2022-11-16 11:35:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:35:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609772687] [2022-11-16 11:35:28,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609772687] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:28,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509492086] [2022-11-16 11:35:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:28,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:28,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:28,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:29,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:35:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:29,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 11:35:29,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:29,466 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 6 treesize of output 5 [2022-11-16 11:35:29,906 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-11-16 11:35:29,915 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-11-16 11:35:30,196 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:35:30,196 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-16 11:35:30,218 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:35:30,219 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-11-16 11:35:30,234 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:35:30,235 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 7 [2022-11-16 11:35:30,481 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3112 (Array Int Int)) (v_ArrVal_3113 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3113)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 11:35:30,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:30,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:30,558 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:35:30,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2022-11-16 11:35:30,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:30,589 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:35:30,590 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 83 [2022-11-16 11:35:30,617 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2022-11-16 11:35:30,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:35:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 39 [2022-11-16 11:35:30,844 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:35:30,845 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2022-11-16 11:35:30,858 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-16 11:35:30,858 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-16 11:35:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:35:30,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509492086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:31,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:31,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2022-11-16 11:35:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095584143] [2022-11-16 11:35:31,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:31,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:35:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:35:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1926, Unknown=1, NotChecked=88, Total=2162 [2022-11-16 11:35:31,502 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:35:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:35,128 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-16 11:35:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:35:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-11-16 11:35:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:35,129 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:35:35,129 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 11:35:35,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=309, Invalid=3476, Unknown=1, NotChecked=120, Total=3906 [2022-11-16 11:35:35,131 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 249 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:35,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2160 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2289 Invalid, 0 Unknown, 224 Unchecked, 2.1s Time] [2022-11-16 11:35:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 11:35:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-11-16 11:35:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 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-11-16 11:35:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-11-16 11:35:35,135 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 48 [2022-11-16 11:35:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:35,136 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-11-16 11:35:35,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:35:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-11-16 11:35:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:35:35,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:35,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:35,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 11:35:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 11:35:35,343 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -645963400, now seen corresponding path program 1 times [2022-11-16 11:35:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717183094] [2022-11-16 11:35:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:35:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:35,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717183094] [2022-11-16 11:35:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717183094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:35,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:35,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:35:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645712237] [2022-11-16 11:35:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:35,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:35:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:35:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:35,537 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:35,696 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-11-16 11:35:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:35:35,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-16 11:35:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:35,700 INFO L225 Difference]: With dead ends: 112 [2022-11-16 11:35:35,700 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:35:35,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:35,701 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:35,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 188 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:35:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:35:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2022-11-16 11:35:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 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-11-16 11:35:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-11-16 11:35:35,704 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 49 [2022-11-16 11:35:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:35,705 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-11-16 11:35:35,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-11-16 11:35:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:35:35,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:35,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:35,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:35:35,706 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432508, now seen corresponding path program 1 times [2022-11-16 11:35:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626737415] [2022-11-16 11:35:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:36,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:36,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:35:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:36,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626737415] [2022-11-16 11:35:36,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626737415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:36,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:36,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:35:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836208481] [2022-11-16 11:35:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:36,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:35:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:35:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:35:36,134 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:36,561 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-16 11:35:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:35:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 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 51 [2022-11-16 11:35:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:36,563 INFO L225 Difference]: With dead ends: 160 [2022-11-16 11:35:36,563 INFO L226 Difference]: Without dead ends: 160 [2022-11-16 11:35:36,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:35:36,563 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 261 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:36,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 421 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:35:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-16 11:35:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2022-11-16 11:35:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 92 states have internal predecessors, (99), 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-11-16 11:35:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-16 11:35:36,567 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2022-11-16 11:35:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:36,568 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-16 11:35:36,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-16 11:35:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:35:36,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:36,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:36,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:35:36,569 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432509, now seen corresponding path program 1 times [2022-11-16 11:35:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:36,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162328916] [2022-11-16 11:35:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:35:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:37,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162328916] [2022-11-16 11:35:37,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162328916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:37,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:35:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439209659] [2022-11-16 11:35:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:37,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:35:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:35:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:35:37,196 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:37,588 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-16 11:35:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:35:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 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 51 [2022-11-16 11:35:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:37,590 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:35:37,590 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 11:35:37,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:35:37,591 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 314 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:37,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 425 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:35:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 11:35:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 99. [2022-11-16 11:35:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 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-11-16 11:35:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-16 11:35:37,596 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 51 [2022-11-16 11:35:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:37,596 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-16 11:35:37,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-16 11:35:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:35:37,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:37,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:35:37,598 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1604261226, now seen corresponding path program 1 times [2022-11-16 11:35:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:37,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563921766] [2022-11-16 11:35:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:37,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563921766] [2022-11-16 11:35:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563921766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286600437] [2022-11-16 11:35:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:38,287 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:38,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:35:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:38,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-16 11:35:38,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:39,041 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 17 treesize of output 9 [2022-11-16 11:35:39,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:39,196 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 26 treesize of output 19 [2022-11-16 11:35:39,280 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 25 treesize of output 13 [2022-11-16 11:35:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:35:39,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:39,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3894 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_3894) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (<= 1 .cse0) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0)))) is different from false [2022-11-16 11:35:39,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286600437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:39,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2022-11-16 11:35:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822357921] [2022-11-16 11:35:39,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:39,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:35:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:35:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=669, Unknown=1, NotChecked=52, Total=812 [2022-11-16 11:35:39,466 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:40,258 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-16 11:35:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:35:40,258 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2022-11-16 11:35:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:40,259 INFO L225 Difference]: With dead ends: 90 [2022-11-16 11:35:40,259 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 11:35:40,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=1077, Unknown=1, NotChecked=68, Total=1332 [2022-11-16 11:35:40,260 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 526 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:40,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 689 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:35:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 11:35:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 11:35:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 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-11-16 11:35:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-16 11:35:40,264 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 53 [2022-11-16 11:35:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:40,264 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-16 11:35:40,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 11:35:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-16 11:35:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:35:40,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:40,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:40,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:40,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:40,472 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash -696733545, now seen corresponding path program 1 times [2022-11-16 11:35:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:40,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468156654] [2022-11-16 11:35:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:41,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 11:35:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:41,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468156654] [2022-11-16 11:35:41,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468156654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:41,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:41,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:35:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291978307] [2022-11-16 11:35:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:41,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:35:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:35:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:35:41,773 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:42,422 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-11-16 11:35:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:35:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 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 54 [2022-11-16 11:35:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:42,424 INFO L225 Difference]: With dead ends: 107 [2022-11-16 11:35:42,424 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 11:35:42,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-11-16 11:35:42,425 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 293 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:42,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 534 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:35:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 11:35:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-16 11:35:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 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-11-16 11:35:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-16 11:35:42,428 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 54 [2022-11-16 11:35:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:42,429 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-16 11:35:42,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-16 11:35:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 11:35:42,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:42,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:42,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:35:42,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -696733544, now seen corresponding path program 1 times [2022-11-16 11:35:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499818655] [2022-11-16 11:35:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:44,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499818655] [2022-11-16 11:35:44,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499818655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:44,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:44,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-16 11:35:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083507446] [2022-11-16 11:35:44,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:44,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 11:35:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 11:35:44,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:35:44,243 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:45,192 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-16 11:35:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:35:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-11-16 11:35:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:45,194 INFO L225 Difference]: With dead ends: 88 [2022-11-16 11:35:45,194 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 11:35:45,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 11:35:45,195 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 565 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:45,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 461 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:35:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 11:35:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-16 11:35:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 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-11-16 11:35:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-16 11:35:45,198 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 54 [2022-11-16 11:35:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:45,199 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-16 11:35:45,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:35:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-16 11:35:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:35:45,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:45,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:45,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 11:35:45,200 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -833520442, now seen corresponding path program 1 times [2022-11-16 11:35:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:45,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201677196] [2022-11-16 11:35:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:35:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201677196] [2022-11-16 11:35:46,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201677196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963316174] [2022-11-16 11:35:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:46,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:46,553 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:46,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:35:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-16 11:35:47,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:47,264 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 6 treesize of output 5 [2022-11-16 11:35:47,621 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-11-16 11:35:47,886 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-16 11:35:47,887 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2022-11-16 11:35:47,893 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 5 treesize of output 3 [2022-11-16 11:35:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:48,401 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:35:48,402 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2022-11-16 11:35:48,432 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-16 11:35:48,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-16 11:35:48,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:48,450 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 26 treesize of output 28 [2022-11-16 11:35:48,788 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:35:49,304 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-16 11:35:49,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 69 [2022-11-16 11:35:49,316 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 21 treesize of output 13 [2022-11-16 11:35:49,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:49,454 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 33 treesize of output 31 [2022-11-16 11:35:49,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:49,507 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 33 treesize of output 31 [2022-11-16 11:35:49,833 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:35:49,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-16 11:35:50,014 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 34 treesize of output 18 [2022-11-16 11:35:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:35:50,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:35:50,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963316174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:50,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:35:50,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [20] total 48 [2022-11-16 11:35:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744255747] [2022-11-16 11:35:50,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:50,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:35:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:35:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2163, Unknown=1, NotChecked=0, Total=2352 [2022-11-16 11:35:50,181 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:35:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:50,877 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-16 11:35:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:35:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2022-11-16 11:35:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:50,878 INFO L225 Difference]: With dead ends: 89 [2022-11-16 11:35:50,878 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 11:35:50,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=255, Invalid=2714, Unknown=1, NotChecked=0, Total=2970 [2022-11-16 11:35:50,880 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:50,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 608 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 301 Unchecked, 0.3s Time] [2022-11-16 11:35:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 11:35:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-16 11:35:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 84 states have internal predecessors, (90), 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-11-16 11:35:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-11-16 11:35:50,884 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 59 [2022-11-16 11:35:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:50,884 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-11-16 11:35:50,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:35:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-11-16 11:35:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:35:50,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:50,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:50,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:51,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:35:51,088 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:35:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash -833520441, now seen corresponding path program 1 times [2022-11-16 11:35:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:51,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478384698] [2022-11-16 11:35:51,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:35:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:35:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:35:54,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:54,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478384698] [2022-11-16 11:35:54,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478384698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:54,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694235165] [2022-11-16 11:35:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:54,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:54,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:35:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:54,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-16 11:35:54,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:54,986 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 6 treesize of output 5 [2022-11-16 11:35:55,034 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 5 treesize of output 3 [2022-11-16 11:35:55,145 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:35:55,146 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-11-16 11:35:55,252 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 6 treesize of output 5 [2022-11-16 11:35:55,777 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 13 treesize of output 9 [2022-11-16 11:35:56,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:35:56,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-16 11:35:56,115 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 7 treesize of output 3 [2022-11-16 11:35:56,128 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 5 treesize of output 3 [2022-11-16 11:35:56,132 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 5 treesize of output 3 [2022-11-16 11:35:56,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:56,721 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:35:56,722 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2022-11-16 11:35:56,745 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:35:56,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 26 [2022-11-16 11:35:56,767 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:35:56,768 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 15 treesize of output 15 [2022-11-16 11:35:56,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:56,781 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-11-16 11:35:57,603 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-16 11:35:57,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 84 [2022-11-16 11:35:57,630 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:35:57,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2022-11-16 11:35:57,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:35:57,652 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-11-16 11:35:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:57,788 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 14 treesize of output 16 [2022-11-16 11:35:57,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:57,808 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 33 treesize of output 31 [2022-11-16 11:35:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:57,876 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-11-16 11:35:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:57,884 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 33 treesize of output 31 [2022-11-16 11:35:58,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:35:58,129 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-16 11:35:58,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:58,136 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 18 treesize of output 20 [2022-11-16 11:35:58,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 11:35:58,266 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 15 treesize of output 7 [2022-11-16 11:35:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:35:58,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:58,622 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:35:58,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (forall ((v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-16 11:35:58,667 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 11:35:58,705 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:36:00,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse0 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-16 11:36:00,801 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 11:36:00,840 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 11:36:00,893 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4808 (Array Int Int)) (v_ArrVal_4809 (Array Int Int)) (v_ArrVal_4812 (Array Int Int)) (v_ArrVal_4813 (Array Int Int)) (v_ArrVal_4814 (Array Int Int)) (v_ArrVal_4815 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4808) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4813))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4809) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4812) .cse1 v_ArrVal_4815) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4814) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 11:36:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694235165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:01,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:36:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2022-11-16 11:36:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967060381] [2022-11-16 11:36:01,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:01,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 11:36:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 11:36:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3440, Unknown=10, NotChecked=1000, Total=4692 [2022-11-16 11:36:01,401 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:36:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:06,611 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-16 11:36:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:36:06,612 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2022-11-16 11:36:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:06,614 INFO L225 Difference]: With dead ends: 112 [2022-11-16 11:36:06,614 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:36:06,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=522, Invalid=5819, Unknown=11, NotChecked=1304, Total=7656 [2022-11-16 11:36:06,617 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 538 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:06,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1169 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1903 Invalid, 0 Unknown, 64 Unchecked, 2.1s Time] [2022-11-16 11:36:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:36:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-11-16 11:36:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 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-11-16 11:36:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-11-16 11:36:06,621 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 59 [2022-11-16 11:36:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:06,621 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-11-16 11:36:06,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 49 states have internal predecessors, (105), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 11:36:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-11-16 11:36:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 11:36:06,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:06,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:06,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:06,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:36:06,828 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:36:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2145741940, now seen corresponding path program 1 times [2022-11-16 11:36:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:06,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392880928] [2022-11-16 11:36:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:36:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:36:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:36:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:11,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392880928] [2022-11-16 11:36:11,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392880928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:11,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021291506] [2022-11-16 11:36:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:11,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:11,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:11,422 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:11,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:36:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:11,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-16 11:36:11,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:11,867 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 6 treesize of output 5 [2022-11-16 11:36:11,969 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 5 treesize of output 3 [2022-11-16 11:36:12,211 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-16 11:36:12,214 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-16 11:36:12,247 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-16 11:36:12,249 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-16 11:36:12,316 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,319 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,365 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,368 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,523 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-11-16 11:36:12,534 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,537 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_~temp~0#1.base|) (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,593 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,596 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,752 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,757 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,861 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:12,867 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:12,891 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 19 treesize of output 18 [2022-11-16 11:36:13,134 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:36:13,134 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 14 treesize of output 20 [2022-11-16 11:36:13,147 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 5 treesize of output 3 [2022-11-16 11:36:13,185 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:13,190 WARN L855 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:13,298 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:13,303 WARN L855 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:13,483 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:36:13,483 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 18 treesize of output 24 [2022-11-16 11:36:13,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:13,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-16 11:36:13,569 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-11-16 11:36:13,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from false [2022-11-16 11:36:13,664 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))))) is different from true [2022-11-16 11:36:13,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from false [2022-11-16 11:36:13,755 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))) is different from true [2022-11-16 11:36:13,860 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-16 11:36:13,865 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 8)) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse0 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-16 11:36:13,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:36:13,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-11-16 11:36:13,900 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 11 treesize of output 7 [2022-11-16 11:36:13,908 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 7 treesize of output 3 [2022-11-16 11:36:13,996 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:14,001 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:14,091 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:14,095 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:14,251 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:14,256 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:14,339 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:14,343 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:14,428 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:14,432 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:14,521 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:14,526 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:14,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:14,639 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 14 treesize of output 16 [2022-11-16 11:36:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:14,695 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:14,695 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 90 [2022-11-16 11:36:14,772 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:36:14,773 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 34 treesize of output 44 [2022-11-16 11:36:14,784 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 5 treesize of output 3 [2022-11-16 11:36:14,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-16 11:36:14,997 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-16 11:36:15,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-16 11:36:15,238 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-16 11:36:15,962 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-16 11:36:15,968 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-16 11:36:16,243 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-16 11:36:16,249 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-16 11:36:16,540 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from false [2022-11-16 11:36:16,546 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse6 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_#valid_BEFORE_CALL_28| .cse7)))) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))))) is different from true [2022-11-16 11:36:16,698 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-16 11:36:16,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 169 treesize of output 142 [2022-11-16 11:36:16,729 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:36:16,729 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 53 [2022-11-16 11:36:16,754 INFO L321 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-11-16 11:36:16,754 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 53 treesize of output 75 [2022-11-16 11:36:16,786 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-16 11:36:17,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-16 11:36:17,028 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-16 11:36:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:17,156 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:17,156 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 108 [2022-11-16 11:36:17,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:17,304 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 26 treesize of output 28 [2022-11-16 11:36:17,361 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:36:17,362 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 41 treesize of output 51 [2022-11-16 11:36:17,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:17,731 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:17,731 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 108 [2022-11-16 11:36:17,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:17,759 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 41 treesize of output 43 [2022-11-16 11:36:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:17,784 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 26 treesize of output 28 [2022-11-16 11:36:18,147 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from false [2022-11-16 11:36:18,154 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse8 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))))))) is different from true [2022-11-16 11:36:18,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-16 11:36:18,730 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse6) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse8) (or (= .cse8 0) (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-16 11:36:18,894 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:18,894 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 115 [2022-11-16 11:36:18,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:18,931 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 33 treesize of output 28 [2022-11-16 11:36:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:18,965 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 24 treesize of output 26 [2022-11-16 11:36:18,990 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 28 treesize of output 22 [2022-11-16 11:36:19,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2022-11-16 11:36:19,288 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (= (select (store |v_#valid_BEFORE_CALL_28| .cse3 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2022-11-16 11:36:19,815 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 67 treesize of output 39 [2022-11-16 11:36:19,838 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 15 treesize of output 7 [2022-11-16 11:36:20,199 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-16 11:36:20,206 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem16#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem16#1.base| 2)) (.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_#t~mem16#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-16 11:36:20,568 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2022-11-16 11:36:20,573 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2022-11-16 11:36:20,620 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 15 treesize of output 7 [2022-11-16 11:36:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-11-16 11:36:20,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:21,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) is different from false [2022-11-16 11:36:21,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse2 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2022-11-16 11:36:21,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-16 11:36:21,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse2 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2022-11-16 11:36:21,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5139))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5138))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse2 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) is different from false [2022-11-16 11:36:21,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_5132) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5139))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_5131) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5138))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| .cse3 v_ArrVal_5133) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5137))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse4 .cse2 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-16 11:36:22,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_5141 (Array Int Int)) (v_ArrVal_5132 (Array Int Int)) (v_ArrVal_5131 (Array Int Int)) (v_ArrVal_5140 Int) (v_ArrVal_5142 (Array Int Int)) (v_ArrVal_5156 (Array Int Int)) (v_ArrVal_5133 (Array Int Int)) (v_ArrVal_5158 (Array Int Int)) (v_ArrVal_5157 (Array Int Int)) (v_ArrVal_5138 (Array Int Int)) (v_ArrVal_5137 (Array Int Int)) (v_ArrVal_5139 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5157)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5156))) (let ((.cse2 (select (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store .cse6 .cse2 v_ArrVal_5132) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5139))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|) 0)) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse5 .cse2 v_ArrVal_5131) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5138))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5158) .cse2 v_ArrVal_5133) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_5137))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_5140))) (select (select (store .cse3 .cse1 v_ArrVal_5141) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5142) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) is different from false [2022-11-16 11:36:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021291506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:22,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:36:22,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 69 [2022-11-16 11:36:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12732785] [2022-11-16 11:36:22,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:22,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-16 11:36:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-16 11:36:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1699, Unknown=130, NotChecked=4440, Total=6480 [2022-11-16 11:36:22,188 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:36:23,052 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-16 11:36:23,055 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-16 11:36:23,060 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2022-11-16 11:36:23,063 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_create_~data#1|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2022-11-16 11:36:23,068 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:23,072 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:23,077 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:23,080 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:23,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:23,089 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:23,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:23,100 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ 8 |c_node_create_~temp~0#1.offset|))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:23,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-16 11:36:23,122 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse4 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= (select |c_old(#valid)| .cse3) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select .cse4 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= (select .cse4 (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-16 11:36:23,135 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-16 11:36:23,139 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-16 11:36:23,154 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-16 11:36:23,159 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from true [2022-11-16 11:36:23,171 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from false [2022-11-16 11:36:23,176 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not .cse0))) is different from true [2022-11-16 11:36:23,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from false [2022-11-16 11:36:23,194 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (not .cse0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) .cse1)) is different from true [2022-11-16 11:36:23,213 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from false [2022-11-16 11:36:23,217 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (or .cse0 .cse1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= 0 (select |v_old(#valid)_AFTER_CALL_43| .cse2)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)))) .cse1))) is different from true [2022-11-16 11:36:23,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from false [2022-11-16 11:36:23,236 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2))) (and (or .cse0 .cse1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (not .cse1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_27| .cse4)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))))) is different from true [2022-11-16 11:36:23,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from false [2022-11-16 11:36:23,257 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 8))) (.cse1 (= .cse3 .cse2))) (and .cse0 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse2 |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse3)) (not .cse1) (not (= (select |c_#valid| .cse2) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_28| .cse2 1)) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_27| .cse5)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))))))) is different from true [2022-11-16 11:36:23,269 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:23,273 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= |c_old(#length)| |c_#length|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:23,285 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from false [2022-11-16 11:36:23,290 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|)))) is different from true [2022-11-16 11:36:23,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:23,311 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5124 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5124))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5122 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5122) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_5123 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5123) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:23,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:23,336 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse0 (select |v_#valid_BEFORE_CALL_28| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) |c_#memory_int|) (exists ((v_ArrVal_5125 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5125) |c_#memory_$Pointer$.offset|)) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5127 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5127) |c_#memory_int|)) (= .cse1 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (exists ((v_ArrVal_5126 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5126) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:23,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from false [2022-11-16 11:36:23,360 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_~temp~0#1.base|)) (.cse2 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= (select .cse0 8) |c_node_create_#in~data#1|) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse1 (select |v_#valid_BEFORE_CALL_28| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse2)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| .cse0) |c_#memory_int|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_~temp~0#1.base| v_ArrVal_5130) |c_#memory_int|)) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_5129 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5129) |c_#memory_$Pointer$.offset|)) (= .cse2 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 11:36:23,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from false [2022-11-16 11:36:23,649 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse9 (@diff .cse8 |c_#memory_$Pointer$.offset|))) (let ((.cse1 (store .cse8 .cse9 (select |c_#memory_$Pointer$.offset| .cse9)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse2 (@diff .cse1 |c_#memory_$Pointer$.offset|)) (.cse6 (@diff |c_old(#memory_int)| |c_#memory_int|))) (and (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse0 |c_node_create_#res#1.base|)) (or (= |c_#memory_$Pointer$.offset| .cse1) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5130 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_5130) |c_#memory_int|)) (exists ((v_ArrVal_5129 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_5129))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimIndex_22) 0) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_120) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (< v_arrayElimIndex_22 |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_120) 1))) (or (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= |c_#memory_$Pointer$.offset| (store .cse1 .cse2 (select |c_#memory_$Pointer$.offset| .cse2))) (= |c_#valid| (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse5 (select |c_#valid| .cse5)))) (= (store |c_old(#memory_int)| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|))) (or (= |c_old(#memory_int)| |c_#memory_int|) (= .cse6 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_5128 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_5128) |c_#memory_$Pointer$.base|)) (or (= |c_#memory_$Pointer$.offset| .cse8) (= (select |c_old(#valid)| .cse9) 0)))))))) is different from true [2022-11-16 11:36:23,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from false [2022-11-16 11:36:23,701 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_#valid_BEFORE_CALL_28| .cse3)))) (= (select |v_#valid_BEFORE_CALL_28| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 1) (= (select (store |v_#valid_BEFORE_CALL_28| .cse4 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 8)) (= .cse5 .cse4) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (not (= .cse1 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_27| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse8 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |v_#valid_BEFORE_CALL_31| .cse9))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)))))))) is different from true [2022-11-16 11:36:23,741 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2022-11-16 11:36:23,747 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (not (= .cse5 .cse6)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2022-11-16 11:36:23,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2022-11-16 11:36:23,804 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4))) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_27| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |v_#valid_BEFORE_CALL_31| .cse5))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse6 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (= .cse9 .cse8) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse8 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse10 (select |v_#valid_BEFORE_CALL_28| .cse10)))) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse9) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2022-11-16 11:36:23,886 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2022-11-16 11:36:23,892 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse1)) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2022-11-16 11:36:23,982 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from false [2022-11-16 11:36:23,988 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse5)) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) (+ (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 8)) (= .cse8 .cse7) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (not (= .cse5 |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse7 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_#valid_BEFORE_CALL_28| .cse9)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse8) 0))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|))))) is different from true [2022-11-16 11:36:24,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-16 11:36:24,046 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-16 11:36:24,096 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-16 11:36:24,103 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_31| .cse4))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_28| .cse5 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_#valid_BEFORE_CALL_28| .cse6)))) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 8)) (= .cse7 .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5)) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-16 11:36:24,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from false [2022-11-16 11:36:24,159 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 4)) (.cse0 (+ 2 .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_28| .cse2) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |v_#valid_BEFORE_CALL_31| .cse7))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22))))) (not (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| .cse8)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse8) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|)))))) is different from true [2022-11-16 11:36:24,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-16 11:36:24,258 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse2 (= .cse9 0)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 8)) .cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse5 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse6 (+ 2 v_arrayElimIndex_22))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_27| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_27| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_#valid_BEFORE_CALL_28| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_28| .cse1 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select |v_#valid_BEFORE_CALL_28| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_28| .cse7) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |v_#valid_BEFORE_CALL_31| .cse8))) |v_#valid_BEFORE_CALL_31|) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0)))) (<= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| .cse9) (or .cse2 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-16 11:36:24,341 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2022-11-16 11:36:24,346 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10| Int) (|v_#valid_BEFORE_CALL_27| (Array Int Int)) (v_arrayElimCell_147 Int) (|v_#valid_BEFORE_CALL_28| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_120 Int) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#valid_BEFORE_CALL_31| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.base| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22| Int) (v_arrayElimIndex_22 Int)) (let ((.cse3 (+ 2 |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse4 (+ 2 v_arrayElimIndex_22))) (and (= |v_#valid_BEFORE_CALL_27| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_27|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_27| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_45| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) 1) (= |v_#valid_BEFORE_CALL_28| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_#valid_BEFORE_CALL_28|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_#valid_BEFORE_CALL_28| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimCell_147) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (= (select |v_#valid_BEFORE_CALL_27| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 1) (= (select (store |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base| 1) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_28| v_arrayElimCell_147) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_45| v_arrayElimCell_120)) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_8|) 0) (= (select |v_#valid_BEFORE_CALL_31| v_arrayElimCell_120) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) 1) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_10|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_22|) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_31|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_31| .cse6))) |v_#valid_BEFORE_CALL_31|) (= (select |v_#valid_BEFORE_CALL_28| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_31| v_arrayElimIndex_22)) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2022-11-16 11:36:24,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:24,725 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-11-16 11:36:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 11:36:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-11-16 11:36:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:24,726 INFO L225 Difference]: With dead ends: 107 [2022-11-16 11:36:24,726 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 11:36:24,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 67 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=309, Invalid=2021, Unknown=194, NotChecked=10586, Total=13110 [2022-11-16 11:36:24,730 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:24,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 780 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 506 Invalid, 0 Unknown, 1877 Unchecked, 0.6s Time] [2022-11-16 11:36:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 11:36:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-16 11:36:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 100 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:36:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2022-11-16 11:36:24,734 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 61 [2022-11-16 11:36:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:24,735 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2022-11-16 11:36:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.6) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:36:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-11-16 11:36:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 11:36:24,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:24,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:24,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:24,944 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:36:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557417, now seen corresponding path program 1 times [2022-11-16 11:36:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340805296] [2022-11-16 11:36:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:36:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:36:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:36:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:25,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340805296] [2022-11-16 11:36:25,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340805296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:25,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:25,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713136161] [2022-11-16 11:36:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:25,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:36:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:36:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:25,139 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:36:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:25,398 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-11-16 11:36:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:36:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-16 11:36:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:25,399 INFO L225 Difference]: With dead ends: 125 [2022-11-16 11:36:25,399 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 11:36:25,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:36:25,400 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:25,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 304 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 11:36:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2022-11-16 11:36:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:36:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-11-16 11:36:25,404 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 64 [2022-11-16 11:36:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:25,404 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-11-16 11:36:25,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:36:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-11-16 11:36:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 11:36:25,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:25,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:25,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-16 11:36:25,405 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:36:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557418, now seen corresponding path program 1 times [2022-11-16 11:36:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:25,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443234946] [2022-11-16 11:36:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:36:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:36:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:36:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:25,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443234946] [2022-11-16 11:36:25,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443234946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:25,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:25,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:36:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340876538] [2022-11-16 11:36:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:36:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:36:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:36:25,728 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:36:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:25,983 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-11-16 11:36:25,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:36:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-16 11:36:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:25,984 INFO L225 Difference]: With dead ends: 106 [2022-11-16 11:36:25,984 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 11:36:25,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:36:25,985 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:25,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 312 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:36:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 11:36:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2022-11-16 11:36:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:36:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-11-16 11:36:25,989 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 64 [2022-11-16 11:36:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:25,989 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-11-16 11:36:25,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 11:36:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-11-16 11:36:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:36:25,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:25,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:25,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-16 11:36:25,991 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:36:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139761, now seen corresponding path program 1 times [2022-11-16 11:36:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29035150] [2022-11-16 11:36:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:36:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:36:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:36:32,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:32,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29035150] [2022-11-16 11:36:32,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29035150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:32,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177149853] [2022-11-16 11:36:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:32,494 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:32,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:36:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:32,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-16 11:36:32,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:33,690 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 7 treesize of output 3 [2022-11-16 11:36:33,762 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 6 treesize of output 5 [2022-11-16 11:36:34,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:34,324 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 16 treesize of output 18 [2022-11-16 11:36:34,690 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 11:36:34,691 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 21 treesize of output 28 [2022-11-16 11:36:34,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:34,916 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 11:36:34,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2022-11-16 11:36:34,925 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 5 treesize of output 3 [2022-11-16 11:36:35,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:35,101 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 25 treesize of output 20 [2022-11-16 11:36:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:35,449 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-16 11:36:35,449 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2022-11-16 11:36:35,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:35,458 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 0 case distinctions, treesize of input 89 treesize of output 75 [2022-11-16 11:36:36,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:36,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 71 [2022-11-16 11:36:36,667 INFO L321 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2022-11-16 11:36:36,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 48 [2022-11-16 11:36:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:36:36,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:36:36,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177149853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:36,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:36:36,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [38] total 63 [2022-11-16 11:36:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064219327] [2022-11-16 11:36:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:36,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:36:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:36,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:36:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3828, Unknown=1, NotChecked=0, Total=4032 [2022-11-16 11:36:36,807 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:36:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:39,445 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-11-16 11:36:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 11:36:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-11-16 11:36:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:39,447 INFO L225 Difference]: With dead ends: 129 [2022-11-16 11:36:39,447 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 11:36:39,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=300, Invalid=5399, Unknown=1, NotChecked=0, Total=5700 [2022-11-16 11:36:39,448 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 77 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:39,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 814 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 871 Invalid, 0 Unknown, 211 Unchecked, 1.0s Time] [2022-11-16 11:36:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 11:36:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2022-11-16 11:36:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.264367816091954) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:36:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-11-16 11:36:39,452 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 66 [2022-11-16 11:36:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:39,453 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-11-16 11:36:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 11:36:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-11-16 11:36:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:36:39,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:39,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:39,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:39,663 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:36:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:39,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139760, now seen corresponding path program 1 times [2022-11-16 11:36:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640873135] [2022-11-16 11:36:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:36:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:36:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:36:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640873135] [2022-11-16 11:36:48,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640873135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222199457] [2022-11-16 11:36:48,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:48,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:48,700 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:48,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:36:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:49,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-16 11:36:49,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:49,266 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 6 treesize of output 5 [2022-11-16 11:36:49,885 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 5 treesize of output 3 [2022-11-16 11:36:49,890 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 5 treesize of output 3 [2022-11-16 11:36:50,362 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:36:50,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:36:50,387 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 14 [2022-11-16 11:36:50,768 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 11 treesize of output 7 [2022-11-16 11:36:50,800 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 11 treesize of output 7 [2022-11-16 11:36:51,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:36:51,063 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-16 11:36:51,083 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 18 treesize of output 20 [2022-11-16 11:36:51,547 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:36:51,548 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 47 treesize of output 41 [2022-11-16 11:36:51,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:51,580 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 14 treesize of output 16 [2022-11-16 11:36:51,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:51,770 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 21 treesize of output 20 [2022-11-16 11:36:51,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:51,782 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 51 treesize of output 34 [2022-11-16 11:36:52,461 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:36:52,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 39 [2022-11-16 11:36:52,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:52,470 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-11-16 11:36:52,476 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 11 treesize of output 7 [2022-11-16 11:36:52,481 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 5 treesize of output 3 [2022-11-16 11:36:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:53,609 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:53,609 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 80 [2022-11-16 11:36:53,644 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:36:53,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 11:36:53,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:53,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:53,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:36:53,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 11:36:55,166 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-16 11:36:55,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 142 treesize of output 111 [2022-11-16 11:36:55,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,231 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 11:36:55,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2022-11-16 11:36:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,295 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:55,296 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 78 [2022-11-16 11:36:55,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:36:55,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,459 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:36:55,460 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 78 [2022-11-16 11:36:55,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:36:55,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:36:55,948 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:36:55,949 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 84 [2022-11-16 11:36:55,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:55,976 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 11:36:55,976 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-16 11:36:56,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:36:56,711 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:36:56,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-16 11:36:57,159 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:36:57,159 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2022-11-16 11:36:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:57,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:01,233 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 v_ArrVal_6102)))) (let ((.cse12 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12)))) (not (<= 0 .cse12))))))))) is different from false [2022-11-16 11:37:01,332 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ 8 (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse7 .cse8) .cse6)) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-16 11:37:01,376 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_6102)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_6103 Int)) (let ((.cse9 (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse6) 12) (select |c_#length| (select (select .cse9 .cse8) .cse6))))))))))))) is different from false [2022-11-16 11:37:01,421 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ 4 (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_6102)))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_6103)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ 4 (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))) (let ((.cse10 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse9)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse10 (select (select (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse9) 8))))))))))) is different from false [2022-11-16 11:37:01,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_ArrVal_6102)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8))) (not (<= 0 .cse4)))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse7 .cse8) .cse9) 12) (select |c_#length| (select (select .cse10 .cse8) .cse9)))))) (not (<= 0 .cse9)))))))))) is different from false [2022-11-16 11:37:01,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_6102)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6103 Int)) (<= 0 (+ (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_6103)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 8))))))))) (forall ((v_ArrVal_6099 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6102 Int) (v_ArrVal_6095 (Array Int Int)) (v_ArrVal_6098 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6095) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6099)) (.cse11 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6094) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6098))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse13 (+ (select (select .cse14 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse13 v_ArrVal_6102)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_6103 Int)) (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_6103)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse8 .cse9) .cse7) 12) (select |c_#length| (select (select .cse10 .cse9) .cse7)))))))))))))) is different from false [2022-11-16 11:37:02,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222199457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:02,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:02,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 75 [2022-11-16 11:37:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371070047] [2022-11-16 11:37:02,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:02,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 11:37:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 11:37:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=6696, Unknown=13, NotChecked=1014, Total=8010 [2022-11-16 11:37:02,903 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:14,853 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2022-11-16 11:37:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:37:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-11-16 11:37:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:14,855 INFO L225 Difference]: With dead ends: 182 [2022-11-16 11:37:14,855 INFO L226 Difference]: Without dead ends: 182 [2022-11-16 11:37:14,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2535 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=716, Invalid=11950, Unknown=14, NotChecked=1362, Total=14042 [2022-11-16 11:37:14,856 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1195 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:14,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1284 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2439 Invalid, 0 Unknown, 277 Unchecked, 3.1s Time] [2022-11-16 11:37:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-16 11:37:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 113. [2022-11-16 11:37:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-11-16 11:37:14,861 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 66 [2022-11-16 11:37:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:14,862 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-11-16 11:37:14,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 71 states have (on average 1.676056338028169) internal successors, (119), 67 states have internal predecessors, (119), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-11-16 11:37:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 11:37:14,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:14,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:14,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-16 11:37:15,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:15,068 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:37:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139726, now seen corresponding path program 1 times [2022-11-16 11:37:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:15,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952754820] [2022-11-16 11:37:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:19,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:37:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:37:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:37:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:37:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952754820] [2022-11-16 11:37:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952754820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759050204] [2022-11-16 11:37:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:20,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:20,808 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:20,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:37:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:21,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-16 11:37:21,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:21,307 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 6 treesize of output 5 [2022-11-16 11:37:21,384 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 5 treesize of output 3 [2022-11-16 11:37:21,645 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:21,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:37:21,867 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 11 treesize of output 7 [2022-11-16 11:37:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:22,149 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:22,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-16 11:37:22,442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:37:22,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:22,662 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-16 11:37:23,022 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:23,022 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 39 treesize of output 35 [2022-11-16 11:37:23,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:23,052 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 43 treesize of output 30 [2022-11-16 11:37:23,584 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:37:23,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 28 [2022-11-16 11:37:23,591 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-11-16 11:37:23,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:23,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:37:24,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:24,360 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 14 treesize of output 16 [2022-11-16 11:37:24,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:24,389 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:24,389 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 63 [2022-11-16 11:37:24,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:24,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:24,452 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:37:24,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:37:25,566 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-16 11:37:25,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 107 [2022-11-16 11:37:25,597 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:25,597 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2022-11-16 11:37:25,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,837 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:25,837 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 74 [2022-11-16 11:37:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,856 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 33 treesize of output 33 [2022-11-16 11:37:25,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,954 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:25,954 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 74 [2022-11-16 11:37:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:25,975 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 33 treesize of output 33 [2022-11-16 11:37:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:26,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:37:26,394 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 11:37:26,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 68 [2022-11-16 11:37:26,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:26,414 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 43 treesize of output 43 [2022-11-16 11:37:27,370 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 11:37:27,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 28 [2022-11-16 11:37:27,377 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-11-16 11:37:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:37:27,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:27,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 Int)) (= 1 (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |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_append_#t~mem14#1.base| v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:37:28,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-16 11:37:28,348 INFO L321 Elim1Store]: treesize reduction 5, result has 96.5 percent of original size [2022-11-16 11:37:28,348 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 147 treesize of output 146 [2022-11-16 11:37:28,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|)) is different from false [2022-11-16 11:37:28,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|)) is different from false [2022-11-16 11:37:28,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (= .cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse1 (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse4 .cse3 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 11:37:28,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-16 11:37:28,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_6412) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6416))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6413) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse4))) is different from false [2022-11-16 11:37:28,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6430 (Array Int Int)) (v_ArrVal_6420 (Array Int Int)) (v_ArrVal_6412 (Array Int Int)) (v_ArrVal_6418 Int) (v_ArrVal_6413 (Array Int Int)) (v_ArrVal_6416 (Array Int Int)) (v_ArrVal_6429 (Array Int Int)) (v_ArrVal_6417 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6429)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6430))) (let ((.cse5 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (= (let ((.cse1 (store (store .cse6 .cse5 v_ArrVal_6412) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6416))) (let ((.cse3 (store (store .cse4 .cse5 v_ArrVal_6413) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34| v_ArrVal_6417)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_6418)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_6420) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_34|) 0)))) is different from false [2022-11-16 11:37:28,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759050204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:28,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:28,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35] total 71 [2022-11-16 11:37:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476440225] [2022-11-16 11:37:28,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:28,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:37:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:37:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=5399, Unknown=44, NotChecked=1240, Total=6972 [2022-11-16 11:37:28,548 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:36,442 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2022-11-16 11:37:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:37:36,443 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-11-16 11:37:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:36,444 INFO L225 Difference]: With dead ends: 163 [2022-11-16 11:37:36,444 INFO L226 Difference]: Without dead ends: 163 [2022-11-16 11:37:36,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2758 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=667, Invalid=9622, Unknown=45, NotChecked=1656, Total=11990 [2022-11-16 11:37:36,446 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 775 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:36,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1461 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2428 Invalid, 0 Unknown, 170 Unchecked, 2.7s Time] [2022-11-16 11:37:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-16 11:37:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2022-11-16 11:37:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:37:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-11-16 11:37:36,451 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 66 [2022-11-16 11:37:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:36,451 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-11-16 11:37:36,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.7313432835820894) internal successors, (116), 63 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:37:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-11-16 11:37:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:37:36,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:36,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:36,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:36,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:36,661 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:37:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 62737026, now seen corresponding path program 1 times [2022-11-16 11:37:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:36,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044095224] [2022-11-16 11:37:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:37:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:37:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:41,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:37:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:37:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044095224] [2022-11-16 11:37:43,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044095224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439060434] [2022-11-16 11:37:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:43,046 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:43,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:37:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:43,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-16 11:37:43,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:43,570 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 6 treesize of output 5 [2022-11-16 11:37:43,668 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 5 treesize of output 3 [2022-11-16 11:37:43,984 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:43,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:37:44,264 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 11 treesize of output 7 [2022-11-16 11:37:44,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:44,589 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:37:44,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-16 11:37:44,934 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:37:45,180 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:45,180 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2022-11-16 11:37:45,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:45,585 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 39 treesize of output 35 [2022-11-16 11:37:45,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:45,637 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 43 treesize of output 30 [2022-11-16 11:37:46,261 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:37:46,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 28 [2022-11-16 11:37:46,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:46,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:37:46,277 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 7 treesize of output 3 [2022-11-16 11:37:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:47,250 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:47,250 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 63 [2022-11-16 11:37:47,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:47,288 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:37:47,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 11:37:47,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:47,302 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 14 treesize of output 16 [2022-11-16 11:37:48,605 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-16 11:37:48,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 94 [2022-11-16 11:37:48,644 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:37:48,644 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-11-16 11:37:48,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:48,682 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 14 treesize of output 16 [2022-11-16 11:37:48,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:48,708 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:48,709 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 61 [2022-11-16 11:37:48,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:48,791 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 14 treesize of output 16 [2022-11-16 11:37:48,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:48,814 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:37:48,815 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 61 [2022-11-16 11:37:49,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:49,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:37:49,154 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:37:49,154 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 68 [2022-11-16 11:37:49,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:49,169 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 110 treesize of output 104 [2022-11-16 11:37:50,460 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 97 treesize of output 73 [2022-11-16 11:37:50,684 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:37:50,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 36 [2022-11-16 11:37:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:37:50,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:51,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6734 (Array Int Int))) (not (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))) is different from false [2022-11-16 11:37:51,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int))) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-16 11:37:51,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))))) is different from false [2022-11-16 11:37:51,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4)))))))) is different from false [2022-11-16 11:37:51,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 .cse1) (select .cse0 (+ .cse1 4))))))))) is different from false [2022-11-16 11:37:52,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-16 11:37:52,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6731 (Array Int Int)) (v_ArrVal_6730 (Array Int Int)) (v_ArrVal_6734 (Array Int Int)) (v_ArrVal_6726 (Array Int Int)) (v_ArrVal_6727 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_6726) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6730))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_6727) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_6731))) (let ((.cse0 (let ((.cse4 (store .cse5 .cse3 (store (select .cse5 .cse3) (+ 4 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (select (select (store .cse2 .cse3 v_ArrVal_6734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))))))) is different from false [2022-11-16 11:37:52,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439060434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:52,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:52,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35] total 75 [2022-11-16 11:37:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657823783] [2022-11-16 11:37:52,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:52,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-16 11:37:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-16 11:37:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6509, Unknown=33, NotChecked=1176, Total=8010 [2022-11-16 11:37:52,556 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:01,327 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-16 11:38:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:38:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-16 11:38:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:01,329 INFO L225 Difference]: With dead ends: 112 [2022-11-16 11:38:01,329 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:38:01,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=604, Invalid=10946, Unknown=34, NotChecked=1526, Total=13110 [2022-11-16 11:38:01,331 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 125 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:01,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1732 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2099 Invalid, 0 Unknown, 95 Unchecked, 2.7s Time] [2022-11-16 11:38:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:38:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-16 11:38:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.247191011235955) internal successors, (111), 105 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:38:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-16 11:38:01,336 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 68 [2022-11-16 11:38:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:01,336 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-16 11:38:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 71 states have (on average 1.676056338028169) internal successors, (119), 66 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-16 11:38:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 11:38:01,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:01,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:01,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-16 11:38:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-16 11:38:01,544 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:38:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 62769824, now seen corresponding path program 1 times [2022-11-16 11:38:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:01,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863951442] [2022-11-16 11:38:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:38:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:38:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:38:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:38:09,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863951442] [2022-11-16 11:38:09,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863951442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:09,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024959207] [2022-11-16 11:38:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:09,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:09,734 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:09,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:38:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:10,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 219 conjunts are in the unsatisfiable core [2022-11-16 11:38:10,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:10,411 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 6 treesize of output 5 [2022-11-16 11:38:10,529 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-11-16 11:38:11,000 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 7 treesize of output 3 [2022-11-16 11:38:11,005 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 5 treesize of output 3 [2022-11-16 11:38:11,121 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 6 treesize of output 5 [2022-11-16 11:38:12,069 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:38:12,069 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 14 treesize of output 20 [2022-11-16 11:38:12,082 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 5 treesize of output 3 [2022-11-16 11:38:12,122 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:38:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:38:12,627 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 11 treesize of output 7 [2022-11-16 11:38:12,644 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 11 treesize of output 7 [2022-11-16 11:38:12,663 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 14 treesize of output 16 [2022-11-16 11:38:13,046 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:38:13,046 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 73 [2022-11-16 11:38:13,054 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 18 treesize of output 20 [2022-11-16 11:38:13,070 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 31 treesize of output 26 [2022-11-16 11:38:13,703 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:38:13,703 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 14 treesize of output 20 [2022-11-16 11:38:13,710 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 5 treesize of output 3 [2022-11-16 11:38:13,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:38:13,759 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 51 treesize of output 45 [2022-11-16 11:38:13,770 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 23 treesize of output 22 [2022-11-16 11:38:13,989 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 21 treesize of output 20 [2022-11-16 11:38:14,014 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 55 treesize of output 38 [2022-11-16 11:38:14,022 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 20 treesize of output 22 [2022-11-16 11:38:14,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:14,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:14,893 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:38:14,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 65 [2022-11-16 11:38:14,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:14,909 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:38:14,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-16 11:38:14,916 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-11-16 11:38:14,923 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 11 treesize of output 7 [2022-11-16 11:38:14,928 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 5 treesize of output 3 [2022-11-16 11:38:16,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:16,153 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:38:16,153 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 142 [2022-11-16 11:38:16,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:16,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:16,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:16,173 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 0 case distinctions, treesize of input 163 treesize of output 144 [2022-11-16 11:38:16,204 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-16 11:38:16,205 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 1 case distinctions, treesize of input 28 treesize of output 48 [2022-11-16 11:38:16,217 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 5 treesize of output 3 [2022-11-16 11:38:16,254 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-16 11:38:16,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 11:38:16,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-16 11:38:18,610 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-16 11:38:18,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 261 treesize of output 212 [2022-11-16 11:38:18,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:18,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:18,652 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 11:38:18,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 199 [2022-11-16 11:38:18,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:18,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:18,670 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 75 treesize of output 60 [2022-11-16 11:38:18,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:18,985 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:38:18,985 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 140 [2022-11-16 11:38:19,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,005 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 0 case distinctions, treesize of input 162 treesize of output 143 [2022-11-16 11:38:19,060 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 28 treesize of output 30 [2022-11-16 11:38:19,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,284 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:38:19,284 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 140 [2022-11-16 11:38:19,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,305 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 0 case distinctions, treesize of input 162 treesize of output 143 [2022-11-16 11:38:19,317 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 28 treesize of output 30 [2022-11-16 11:38:19,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:19,918 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:38:19,918 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 119 [2022-11-16 11:38:19,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,946 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-16 11:38:19,946 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 149 [2022-11-16 11:38:19,960 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 30 treesize of output 32 [2022-11-16 11:38:21,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 11:38:22,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:22,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:38:22,831 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:38:22,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 92 [2022-11-16 11:38:22,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:22,850 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:38:22,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 27 [2022-11-16 11:38:23,201 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 15 treesize of output 7 [2022-11-16 11:38:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:23,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:42,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024959207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:42,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:42,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 40] total 77 [2022-11-16 11:38:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453967297] [2022-11-16 11:38:42,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:42,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-16 11:38:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-16 11:38:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=8369, Unknown=19, NotChecked=0, Total=8742 [2022-11-16 11:38:42,481 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:59,929 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-11-16 11:38:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:38:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-16 11:38:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:59,931 INFO L225 Difference]: With dead ends: 112 [2022-11-16 11:38:59,931 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:38:59,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=733, Invalid=14008, Unknown=21, NotChecked=0, Total=14762 [2022-11-16 11:38:59,933 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:59,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1926 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2343 Invalid, 0 Unknown, 352 Unchecked, 3.6s Time] [2022-11-16 11:38:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:38:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-16 11:38:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 105 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:38:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-11-16 11:38:59,938 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 68 [2022-11-16 11:38:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:59,938 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-11-16 11:38:59,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 69 states have internal predecessors, (118), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:38:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-11-16 11:38:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:38:59,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:59,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:59,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:39:00,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:00,148 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-16 11:39:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2089489187, now seen corresponding path program 1 times [2022-11-16 11:39:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:00,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961808241] [2022-11-16 11:39:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:39:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:39:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:39:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:39:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961808241] [2022-11-16 11:39:11,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961808241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878576279] [2022-11-16 11:39:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:11,876 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:39:11,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c8da9ec-5d58-4133-bf85-1a6b1d3a2c82/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 11:39:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:12,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-16 11:39:12,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:12,483 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 6 treesize of output 5 [2022-11-16 11:39:12,602 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 5 treesize of output 3 [2022-11-16 11:39:12,949 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:39:12,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 11:39:13,211 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 5 treesize of output 3 [2022-11-16 11:39:13,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:13,449 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 11 treesize of output 7 [2022-11-16 11:39:14,090 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 7 treesize of output 3 [2022-11-16 11:39:14,214 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 6 treesize of output 5 [2022-11-16 11:39:15,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:15,050 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 16 treesize of output 18 [2022-11-16 11:39:15,580 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 11:39:15,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 21 treesize of output 28 [2022-11-16 11:39:15,587 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 6 treesize of output 5 [2022-11-16 11:39:15,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:15,875 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 11:39:15,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2022-11-16 11:39:15,885 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 5 treesize of output 3 [2022-11-16 11:39:15,894 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 6 treesize of output 5 [2022-11-16 11:39:15,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:15,970 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 16 treesize of output 18 [2022-11-16 11:39:15,984 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 6 treesize of output 5 [2022-11-16 11:39:16,245 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-16 11:39:16,246 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2022-11-16 11:39:16,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:16,256 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 49 treesize of output 49 [2022-11-16 11:39:16,629 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 46 treesize of output 34 [2022-11-16 11:39:16,840 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-16 11:39:16,841 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 22 [2022-11-16 11:39:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:39:16,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:39:17,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |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_append_#t~mem14#1.base| v_ArrVal_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-16 11:39:17,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7389 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 1)) is different from false [2022-11-16 11:39:17,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array Int Int)) (v_ArrVal_7389 (Array Int Int)) (v_ArrVal_7385 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7385))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_7386)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_7389) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2022-11-16 11:39:17,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:17,689 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 20230 treesize of output 19921 [2022-11-16 11:39:17,725 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 19910 treesize of output 19782 [2022-11-16 11:39:17,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:17,792 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 19782 treesize of output 19630 [2022-11-16 11:39:17,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:39:17,859 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 19622 treesize of output 19310