./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc --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 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:52:43,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:43,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:43,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:43,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:43,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:43,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:43,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:43,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:43,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:43,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:43,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:43,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:43,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:43,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:43,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:43,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:43,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:43,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:43,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:43,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:43,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:43,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:43,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:43,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:43,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:43,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:43,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:43,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:43,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:43,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:43,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:43,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:43,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:43,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:43,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:43,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:43,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:43,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:43,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:43,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:43,504 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:52:43,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:43,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:43,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:43,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:43,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:43,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:43,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:43,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:43,529 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:43,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:43,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:43,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:52:43,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:43,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:43,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:43,531 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:52:43,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:52:43,531 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:52:43,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:43,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:52:43,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:43,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:43,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:43,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:43,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:43,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:43,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:43,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:43,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:43,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:43,535 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_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/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_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2022-11-02 20:52:43,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:43,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:43,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:43,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:43,859 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:43,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-02 20:52:43,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/data/4abaf2db8/2b7499d2e115454cafcf48b17cd4f5da/FLAG6b926cc96 [2022-11-02 20:52:44,451 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:44,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-11-02 20:52:44,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/data/4abaf2db8/2b7499d2e115454cafcf48b17cd4f5da/FLAG6b926cc96 [2022-11-02 20:52:44,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/data/4abaf2db8/2b7499d2e115454cafcf48b17cd4f5da [2022-11-02 20:52:44,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:44,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:44,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:44,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:44,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:44,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:44" (1/1) ... [2022-11-02 20:52:44,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172877cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:44, skipping insertion in model container [2022-11-02 20:52:44,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:44" (1/1) ... [2022-11-02 20:52:44,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:44,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:45,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-02 20:52:45,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:45,302 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:45,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/sv-benchmarks/c/list-simple/dll2c_append_equal.i[24585,24598] [2022-11-02 20:52:45,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:45,425 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:45,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45 WrapperNode [2022-11-02 20:52:45,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:45,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:45,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:45,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:45,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,514 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-11-02 20:52:45,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:45,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:45,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:45,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:45,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:45,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:45,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:45,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:45,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (1/1) ... [2022-11-02 20:52:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:45,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:45,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:52:45,696 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:52:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:52:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:52:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:52:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:52:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:45,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:45,833 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:45,835 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:46,400 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:46,416 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:46,416 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:52:46,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:46 BoogieIcfgContainer [2022-11-02 20:52:46,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:46,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:46,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:46,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:46,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:44" (1/3) ... [2022-11-02 20:52:46,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bca4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:46, skipping insertion in model container [2022-11-02 20:52:46,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:45" (2/3) ... [2022-11-02 20:52:46,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bca4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:46, skipping insertion in model container [2022-11-02 20:52:46,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:46" (3/3) ... [2022-11-02 20:52:46,439 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2022-11-02 20:52:46,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:46,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-11-02 20:52:46,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:46,512 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;@43149abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:46,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-11-02 20:52:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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-02 20:52:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:52:46,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:46,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:52:46,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash 895333938, now seen corresponding path program 1 times [2022-11-02 20:52:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652243924] [2022-11-02 20:52:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:46,879 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-02 20:52:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:46,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652243924] [2022-11-02 20:52:46,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652243924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:46,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:46,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:52:46,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776276010] [2022-11-02 20:52:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:46,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:46,935 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.090909090909091) internal successors, (138), 126 states have internal predecessors, (138), 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-02 20:52:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,140 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2022-11-02 20:52:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:47,143 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-02 20:52:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,151 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:52:47,152 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:52:47,154 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-02 20:52:47,157 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 195 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:52:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-02 20:52:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 1.984375) internal successors, (127), 120 states have internal predecessors, (127), 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-02 20:52:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-11-02 20:52:47,205 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 6 [2022-11-02 20:52:47,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:47,205 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-11-02 20:52:47,206 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-02 20:52:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-11-02 20:52:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:52:47,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:47,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:47,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 895333939, now seen corresponding path program 1 times [2022-11-02 20:52:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095084755] [2022-11-02 20:52:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,313 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-02 20:52:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:47,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095084755] [2022-11-02 20:52:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095084755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:47,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:47,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:52:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739880151] [2022-11-02 20:52:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:47,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:47,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:47,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:47,317 INFO L87 Difference]: Start difference. First operand 125 states and 133 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-02 20:52:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,434 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-11-02 20:52:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:47,434 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-02 20:52:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,436 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:52:47,436 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:52:47,436 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-02 20:52:47,438 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:52:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:52:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-02 20:52:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 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-02 20:52:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-02 20:52:47,449 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 6 [2022-11-02 20:52:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:47,449 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-02 20:52:47,449 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-02 20:52:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-02 20:52:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:52:47,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:47,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:47,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1787864811, now seen corresponding path program 1 times [2022-11-02 20:52:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434086225] [2022-11-02 20:52:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,622 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-02 20:52:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:47,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434086225] [2022-11-02 20:52:47,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434086225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:47,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:52:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999897428] [2022-11-02 20:52:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:47,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:52:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:52:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:52:47,626 INFO L87 Difference]: Start difference. First operand 122 states and 130 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-02 20:52:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,797 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-02 20:52:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:52:47,798 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-02 20:52:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,799 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:52:47,799 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:52:47,800 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-02 20:52:47,801 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:52:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2022-11-02 20:52:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 118 states have internal predecessors, (125), 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-02 20:52:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2022-11-02 20:52:47,814 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 14 [2022-11-02 20:52:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:47,814 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2022-11-02 20:52:47,815 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-02 20:52:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2022-11-02 20:52:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:52:47,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:47,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:47,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:52:47,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134272, now seen corresponding path program 1 times [2022-11-02 20:52:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:47,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825104806] [2022-11-02 20:52:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,124 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-02 20:52:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:48,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825104806] [2022-11-02 20:52:48,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825104806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:48,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:48,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:48,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038697401] [2022-11-02 20:52:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:48,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:48,130 INFO L87 Difference]: Start difference. First operand 123 states and 131 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-02 20:52:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:48,481 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-11-02 20:52:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:48,481 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-02 20:52:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:48,484 INFO L225 Difference]: With dead ends: 123 [2022-11-02 20:52:48,484 INFO L226 Difference]: Without dead ends: 123 [2022-11-02 20:52:48,484 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-02 20:52:48,485 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 21 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:48,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-02 20:52:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-11-02 20:52:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 117 states have internal predecessors, (124), 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-02 20:52:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-02 20:52:48,499 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2022-11-02 20:52:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:48,500 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-02 20:52:48,500 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-02 20:52:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-02 20:52:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:52:48,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:48,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:48,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:48,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1282134271, now seen corresponding path program 1 times [2022-11-02 20:52:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916150721] [2022-11-02 20:52:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,872 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-02 20:52:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:48,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916150721] [2022-11-02 20:52:48,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916150721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:48,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:48,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520451698] [2022-11-02 20:52:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:48,875 INFO L87 Difference]: Start difference. First operand 122 states and 130 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-02 20:52:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:49,247 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-11-02 20:52:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:49,248 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-02 20:52:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:49,249 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:52:49,249 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:52:49,249 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-02 20:52:49,251 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:49,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 424 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:52:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-11-02 20:52:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 116 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-02 20:52:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-11-02 20:52:49,258 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-11-02 20:52:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:49,259 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-11-02 20:52:49,259 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-02 20:52:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-11-02 20:52:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:52:49,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:49,261 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-02 20:52:49,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:52:49,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash 524578273, now seen corresponding path program 1 times [2022-11-02 20:52:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:49,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022454232] [2022-11-02 20:52:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,594 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-02 20:52:49,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022454232] [2022-11-02 20:52:49,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022454232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654414350] [2022-11-02 20:52:49,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:49,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:49,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:49,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:49,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:49,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:52:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:49,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:49,974 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:52:49,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:49,990 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-02 20:52:49,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:50,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654414350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:50,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-02 20:52:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896982965] [2022-11-02 20:52:50,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:50,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:52:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:52:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:50,063 INFO L87 Difference]: Start difference. First operand 121 states and 129 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-02 20:52:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:50,464 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-02 20:52:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:50,465 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-02 20:52:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:50,466 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:52:50,466 INFO L226 Difference]: Without dead ends: 146 [2022-11-02 20:52:50,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:52:50,467 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 103 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:50,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 436 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 423 Invalid, 0 Unknown, 66 Unchecked, 0.4s Time] [2022-11-02 20:52:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-02 20:52:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-11-02 20:52:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8695652173913044) internal successors, (129), 120 states have internal predecessors, (129), 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-02 20:52:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2022-11-02 20:52:50,488 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 26 [2022-11-02 20:52:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:50,489 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2022-11-02 20:52:50,489 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-02 20:52:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2022-11-02 20:52:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:52:50,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:50,490 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-02 20:52:50,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:50,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:50,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 524578274, now seen corresponding path program 1 times [2022-11-02 20:52:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:50,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906046952] [2022-11-02 20:52:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,251 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-02 20:52:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906046952] [2022-11-02 20:52:51,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906046952] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823482619] [2022-11-02 20:52:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:51,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:51,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:51,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:51,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:52:51,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:51,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:51,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:51,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:51,808 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:52:51,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:51,851 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-02 20:52:51,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:54,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823482619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:54,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:54,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2022-11-02 20:52:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080606388] [2022-11-02 20:52:54,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:54,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:52:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:52:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:52:54,060 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 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-02 20:52:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:54,978 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-11-02 20:52:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 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-02 20:52:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:54,980 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:52:54,980 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:52:54,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:52:54,981 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:54,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 808 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 698 Invalid, 0 Unknown, 91 Unchecked, 0.7s Time] [2022-11-02 20:52:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:52:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-02 20:52:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 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-02 20:52:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-11-02 20:52:54,999 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 26 [2022-11-02 20:52:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:54,999 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-11-02 20:52:55,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 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-02 20:52:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-11-02 20:52:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:52:55,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:55,005 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-02 20:52:55,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:55,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1608700855, now seen corresponding path program 1 times [2022-11-02 20:52:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:55,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096296574] [2022-11-02 20:52:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:55,426 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-02 20:52:55,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096296574] [2022-11-02 20:52:55,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096296574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:55,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766415684] [2022-11-02 20:52:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:55,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:55,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:55,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:52:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:55,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:52:55,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:55,658 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-02 20:52:55,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:55,765 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-02 20:52:55,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766415684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:55,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:55,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-02 20:52:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690977285] [2022-11-02 20:52:55,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:55,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:55,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:55,770 INFO L87 Difference]: Start difference. First operand 126 states and 136 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-02 20:52:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:55,984 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-02 20:52:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:55,985 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-02 20:52:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:55,986 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:52:55,986 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:52:55,986 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-02 20:52:55,987 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:55,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 618 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:52:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-11-02 20:52:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 120 states have internal predecessors, (127), 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-02 20:52:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2022-11-02 20:52:55,993 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 28 [2022-11-02 20:52:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:55,993 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2022-11-02 20:52:55,993 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-02 20:52:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2022-11-02 20:52:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:52:56,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:56,003 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-02 20:52:56,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:56,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:56,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661710, now seen corresponding path program 1 times [2022-11-02 20:52:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:56,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423373777] [2022-11-02 20:52:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,342 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-02 20:52:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423373777] [2022-11-02 20:52:56,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423373777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508202813] [2022-11-02 20:52:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:56,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:56,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:56,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:52:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:52:56,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:56,557 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-02 20:52:56,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:56,577 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:52:56,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:56,605 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-02 20:52:56,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508202813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:56,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:56,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-02 20:52:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536255326] [2022-11-02 20:52:56,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:56,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:56,608 INFO L87 Difference]: Start difference. First operand 126 states and 135 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-02 20:52:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:56,873 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2022-11-02 20:52:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:56,874 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-02 20:52:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:56,875 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:52:56,875 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:52:56,875 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-02 20:52:56,876 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 12 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:56,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 403 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:52:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-11-02 20:52:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 123 states have internal predecessors, (132), 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-02 20:52:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2022-11-02 20:52:56,882 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 29 [2022-11-02 20:52:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:56,883 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2022-11-02 20:52:56,883 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-02 20:52:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2022-11-02 20:52:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:52:56,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:56,884 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-02 20:52:56,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:57,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:57,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1674661709, now seen corresponding path program 1 times [2022-11-02 20:52:57,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:57,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275842600] [2022-11-02 20:52:57,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:57,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,386 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-02 20:52:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:57,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275842600] [2022-11-02 20:52:57,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275842600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:57,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273094977] [2022-11-02 20:52:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:57,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:57,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:57,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:52:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:57,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:52:57,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:57,725 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-02 20:52:57,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:57,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:57,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:52:57,962 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-02 20:52:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273094977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:57,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:57,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-02 20:52:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793034652] [2022-11-02 20:52:57,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:57,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:52:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:57,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:52:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:57,965 INFO L87 Difference]: Start difference. First operand 129 states and 140 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-02 20:52:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:58,341 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2022-11-02 20:52:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:58,342 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-02 20:52:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:58,343 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:52:58,343 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:52:58,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:52:58,345 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:58,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1109 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:52:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2022-11-02 20:52:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 123 states have internal predecessors, (131), 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-02 20:52:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-11-02 20:52:58,350 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 29 [2022-11-02 20:52:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:58,350 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-11-02 20:52:58,351 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-02 20:52:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-11-02 20:52:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:52:58,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:58,352 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-02 20:52:58,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:52:58,571 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -374905453, now seen corresponding path program 1 times [2022-11-02 20:52:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:58,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693128651] [2022-11-02 20:52:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:58,766 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-02 20:52:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:58,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693128651] [2022-11-02 20:52:58,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693128651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:58,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:58,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577015120] [2022-11-02 20:52:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:58,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:58,771 INFO L87 Difference]: Start difference. First operand 129 states and 139 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-02 20:52:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:59,175 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-02 20:52:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:59,175 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-02 20:52:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:59,176 INFO L225 Difference]: With dead ends: 129 [2022-11-02 20:52:59,176 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 20:52:59,177 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-02 20:52:59,177 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 23 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:59,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 445 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:52:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 20:52:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-02 20:52:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8055555555555556) internal successors, (130), 122 states have internal predecessors, (130), 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-02 20:52:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-11-02 20:52:59,182 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 30 [2022-11-02 20:52:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:59,182 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-11-02 20:52:59,182 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-02 20:52:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-11-02 20:52:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:52:59,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:59,184 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-02 20:52:59,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:52:59,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -374905452, now seen corresponding path program 1 times [2022-11-02 20:52:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:59,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431093745] [2022-11-02 20:52:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:52:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:59,493 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-02 20:52:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431093745] [2022-11-02 20:52:59,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431093745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:59,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:59,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129914059] [2022-11-02 20:52:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:59,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:59,495 INFO L87 Difference]: Start difference. First operand 128 states and 138 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-02 20:52:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:59,872 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-02 20:52:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:52:59,873 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-02 20:52:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:59,874 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:52:59,874 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:52:59,874 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-02 20:52:59,875 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 20 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:59,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:52:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:52:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:52:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 121 states have internal predecessors, (129), 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-02 20:52:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-02 20:52:59,879 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-11-02 20:52:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:59,879 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-02 20:52:59,879 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-02 20:52:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-02 20:52:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:52:59,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:59,880 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-02 20:52:59,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:52:59,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:52:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -688454360, now seen corresponding path program 1 times [2022-11-02 20:52:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:59,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444479971] [2022-11-02 20:52:59,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,041 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-02 20:53:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444479971] [2022-11-02 20:53:00,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444479971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987274643] [2022-11-02 20:53:00,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:00,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:00,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:00,044 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:00,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:53:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:53:00,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:00,291 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-02 20:53:00,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987274643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:00,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:53:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526911250] [2022-11-02 20:53:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:00,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:00,294 INFO L87 Difference]: Start difference. First operand 127 states and 137 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-02 20:53:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:00,311 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-11-02 20:53:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:00,312 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-02 20:53:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:00,313 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:53:00,313 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:53:00,313 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-02 20:53:00,316 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 198 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 134 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-02 20:53:00,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:53:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-02 20:53:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 110 states have internal predecessors, (115), 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-02 20:53:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-11-02 20:53:00,323 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 41 [2022-11-02 20:53:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:00,323 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-11-02 20:53:00,324 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-02 20:53:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-11-02 20:53:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:53:00,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:00,329 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-02 20:53:00,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:00,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:00,543 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008248, now seen corresponding path program 1 times [2022-11-02 20:53:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610628133] [2022-11-02 20:53:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,067 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-02 20:53:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610628133] [2022-11-02 20:53:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610628133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506149319] [2022-11-02 20:53:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:01,069 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:01,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:53:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:53:01,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:01,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:01,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:01,480 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from false [2022-11-02 20:53:01,483 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from true [2022-11-02 20:53:01,559 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:01,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:01,635 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:01,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:01,653 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-02 20:53:01,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506149319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:01,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-11-02 20:53:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461932533] [2022-11-02 20:53:01,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:53:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:53:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=142, Unknown=2, NotChecked=24, Total=210 [2022-11-02 20:53:01,995 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:53:02,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:53:02,088 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:53:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:02,521 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-11-02 20:53:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:53:02,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-02 20:53:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:02,523 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:53:02,523 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:53:02,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=213, Unknown=4, NotChecked=62, Total=342 [2022-11-02 20:53:02,524 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:02,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 473 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 499 Invalid, 0 Unknown, 194 Unchecked, 0.4s Time] [2022-11-02 20:53:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:53:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-11-02 20:53:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 103 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-02 20:53:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2022-11-02 20:53:02,528 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 43 [2022-11-02 20:53:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:02,528 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-11-02 20:53:02,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:53:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2022-11-02 20:53:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:53:02,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:02,529 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-02 20:53:02,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:02,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:53:02,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1191008247, now seen corresponding path program 1 times [2022-11-02 20:53:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:02,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485691636] [2022-11-02 20:53:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,557 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-02 20:53:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:03,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485691636] [2022-11-02 20:53:03,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485691636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:03,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779585519] [2022-11-02 20:53:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:03,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:03,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:53:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:53:03,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:03,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:03,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:03,965 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:53:03,972 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:53:04,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:04,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:04,388 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-02 20:53:04,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:04,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779585519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:04,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:04,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 12 [2022-11-02 20:53:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13517621] [2022-11-02 20:53:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=100, Unknown=2, NotChecked=20, Total=156 [2022-11-02 20:53:04,392 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:04,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:53:04,443 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:53:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:04,675 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-02 20:53:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:04,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-11-02 20:53:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:04,677 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:53:04,677 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:53:04,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=119, Unknown=4, NotChecked=46, Total=210 [2022-11-02 20:53:04,678 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 156 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:04,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 180 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2022-11-02 20:53:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:53:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-02 20:53:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 95 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-02 20:53:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-11-02 20:53:04,681 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 43 [2022-11-02 20:53:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:04,681 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-11-02 20:53:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-11-02 20:53:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:53:04,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:04,682 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-02 20:53:04,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:53:04,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625015, now seen corresponding path program 1 times [2022-11-02 20:53:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:04,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817511048] [2022-11-02 20:53:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,054 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-02 20:53:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:05,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817511048] [2022-11-02 20:53:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817511048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:05,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:05,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504467126] [2022-11-02 20:53:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:05,057 INFO L87 Difference]: Start difference. First operand 100 states and 106 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-02 20:53:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:05,289 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-11-02 20:53:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:05,289 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-02 20:53:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:05,290 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:53:05,290 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:53:05,290 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-02 20:53:05,291 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 264 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:53:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-02 20:53:05,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.476923076923077) internal successors, (96), 91 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-02 20:53:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-02 20:53:05,294 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 45 [2022-11-02 20:53:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:05,295 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-02 20:53:05,295 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-02 20:53:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-02 20:53:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:53:05,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:05,295 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-02 20:53:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:53:05,296 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2097625014, now seen corresponding path program 1 times [2022-11-02 20:53:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:05,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872857603] [2022-11-02 20:53:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,633 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-02 20:53:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:05,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872857603] [2022-11-02 20:53:05,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872857603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:05,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:05,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394443393] [2022-11-02 20:53:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:05,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:05,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:05,635 INFO L87 Difference]: Start difference. First operand 96 states and 102 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-02 20:53:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:05,842 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-02 20:53:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:05,842 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-02 20:53:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:05,843 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:53:05,843 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:53:05,844 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-02 20:53:05,844 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 70 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:05,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 279 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:53:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-02 20:53:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 87 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-02 20:53:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-11-02 20:53:05,848 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 45 [2022-11-02 20:53:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:05,848 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-11-02 20:53:05,848 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-02 20:53:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-11-02 20:53:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:05,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:05,849 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-02 20:53:05,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:53:05,850 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash -601855080, now seen corresponding path program 1 times [2022-11-02 20:53:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:05,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865102359] [2022-11-02 20:53:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,786 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-02 20:53:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865102359] [2022-11-02 20:53:06,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865102359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:06,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734489886] [2022-11-02 20:53:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:06,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:06,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:06,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:53:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:53:07,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:07,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:07,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:07,524 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2354 (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|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2354)))) is different from true [2022-11-02 20:53:07,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:07,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:07,585 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-02 20:53:07,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-11-02 20:53:07,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:07,635 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-02 20:53:07,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:07,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 (Array Int Int)) (|v_node_create_~temp~0#1.base_53| Int)) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_53|))) (not (< |v_node_create_~temp~0#1.base_53| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_53| v_ArrVal_2362) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_53| 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-02 20:53:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734489886] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:07,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-11-02 20:53:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613210502] [2022-11-02 20:53:07,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 20:53:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 20:53:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=481, Unknown=2, NotChecked=90, Total=650 [2022-11-02 20:53:07,712 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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-02 20:53:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:08,473 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-02 20:53:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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-02 20:53:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:08,475 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:53:08,475 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:53:08,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=800, Unknown=2, NotChecked=118, Total=1056 [2022-11-02 20:53:08,476 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 43 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:08,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 532 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2022-11-02 20:53:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:53:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-02 20:53:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 86 states have internal predecessors, (91), 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-02 20:53:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-02 20:53:08,479 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 46 [2022-11-02 20:53:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:08,480 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-02 20:53:08,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 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-02 20:53:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-02 20:53:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:08,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:08,481 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-02 20:53:08,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:08,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:53:08,681 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash -601855079, now seen corresponding path program 1 times [2022-11-02 20:53:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:08,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333229988] [2022-11-02 20:53:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,440 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-02 20:53:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:10,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333229988] [2022-11-02 20:53:10,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333229988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:10,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925262862] [2022-11-02 20:53:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:10,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:10,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:10,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:53:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:53:10,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:10,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:10,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:11,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:11,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:11,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-02 20:53:11,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:11,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,812 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:53:11,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-11-02 20:53:11,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,951 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-02 20:53:11,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:13,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925262862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:13,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:13,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2022-11-02 20:53:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523755523] [2022-11-02 20:53:13,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:53:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:53:13,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1022, Unknown=2, NotChecked=0, Total=1122 [2022-11-02 20:53:13,122 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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-02 20:53:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:15,201 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-02 20:53:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:53:15,202 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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-02 20:53:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:15,203 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:53:15,203 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:53:15,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=198, Invalid=1776, Unknown=6, NotChecked=0, Total=1980 [2022-11-02 20:53:15,205 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:15,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 851 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 633 Invalid, 0 Unknown, 93 Unchecked, 0.8s Time] [2022-11-02 20:53:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:53:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-02 20:53:15,208 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-02 20:53:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-02 20:53:15,209 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2022-11-02 20:53:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:15,209 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-02 20:53:15,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 27 states have internal predecessors, (73), 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-02 20:53:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-02 20:53:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:53:15,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:15,211 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-02 20:53:15,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:15,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:15,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854233, now seen corresponding path program 1 times [2022-11-02 20:53:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424099917] [2022-11-02 20:53:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,983 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-02 20:53:17,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424099917] [2022-11-02 20:53:17,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424099917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:17,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134017369] [2022-11-02 20:53:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:17,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:17,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:53:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-02 20:53:18,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:18,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:18,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:53:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:18,893 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:18,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 14 [2022-11-02 20:53:18,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:19,114 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2858 (Array Int Int)) (v_ArrVal_2857 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2858)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2857)))) is different from true [2022-11-02 20:53:19,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:19,190 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:53:19,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:19,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:19,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 38 [2022-11-02 20:53:19,255 INFO L356 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2022-11-02 20:53:19,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:19,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:53:19,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:19,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:19,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-11-02 20:53:19,496 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-02 20:53:19,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:19,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2871 Int) (|v_node_create_~temp~0#1.base_59| Int) (v_ArrVal_2870 (Array Int Int))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_59|) 0)) (not (< |v_node_create_~temp~0#1.base_59| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_59| v_ArrVal_2871) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_59| v_ArrVal_2870))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_59| v_ArrVal_2869) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) 1))) is different from false [2022-11-02 20:53:19,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134017369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:19,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:19,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 33 [2022-11-02 20:53:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778211366] [2022-11-02 20:53:19,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:19,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:53:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:53:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1079, Unknown=2, NotChecked=134, Total=1332 [2022-11-02 20:53:19,690 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:21,644 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-02 20:53:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:53:21,644 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2022-11-02 20:53:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:21,645 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:53:21,646 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:53:21,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=235, Invalid=1933, Unknown=2, NotChecked=182, Total=2352 [2022-11-02 20:53:21,647 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 102 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:21,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1349 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1237 Invalid, 0 Unknown, 204 Unchecked, 1.2s Time] [2022-11-02 20:53:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:53:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2022-11-02 20:53:21,650 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-02 20:53:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-02 20:53:21,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 48 [2022-11-02 20:53:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:21,651 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-02 20:53:21,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.193548387096774) internal successors, (68), 30 states have internal predecessors, (68), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-02 20:53:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:53:21,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:21,652 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-02 20:53:21,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:21,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:21,878 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1437854234, now seen corresponding path program 1 times [2022-11-02 20:53:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:21,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004778261] [2022-11-02 20:53:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,694 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-02 20:53:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:24,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004778261] [2022-11-02 20:53:24,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004778261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:24,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219714482] [2022-11-02 20:53:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:24,697 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:24,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:53:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-02 20:53:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:25,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:25,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:53:25,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:53:25,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:25,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:25,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 44 [2022-11-02 20:53:25,914 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:25,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 22 [2022-11-02 20:53:26,165 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3115 (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|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3114) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3115) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:53:26,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:26,238 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:53:26,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:26,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:26,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:26,253 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:26,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 81 [2022-11-02 20:53:26,276 INFO L356 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2022-11-02 20:53:26,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:26,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:26,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:26,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 50 [2022-11-02 20:53:26,527 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:26,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-02 20:53:26,620 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-02 20:53:26,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219714482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:28,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 40 [2022-11-02 20:53:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129240179] [2022-11-02 20:53:28,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-02 20:53:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-02 20:53:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1839, Unknown=1, NotChecked=86, Total=2070 [2022-11-02 20:53:28,637 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 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-02 20:53:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:31,814 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-11-02 20:53:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:53:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 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 48 [2022-11-02 20:53:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:31,815 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:53:31,815 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:53:31,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=312, Invalid=3473, Unknown=1, NotChecked=120, Total=3906 [2022-11-02 20:53:31,818 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 222 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:31,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1785 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1699 Invalid, 0 Unknown, 200 Unchecked, 1.6s Time] [2022-11-02 20:53:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:53:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2022-11-02 20:53:31,821 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-02 20:53:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-02 20:53:31,821 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 48 [2022-11-02 20:53:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:31,822 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-02 20:53:31,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 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-02 20:53:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-02 20:53:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:53:31,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:31,823 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-02 20:53:31,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:32,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:53:32,039 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1298391309, now seen corresponding path program 1 times [2022-11-02 20:53:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336444475] [2022-11-02 20:53:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,224 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-02 20:53:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336444475] [2022-11-02 20:53:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336444475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:32,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:32,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:32,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537253459] [2022-11-02 20:53:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:32,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:32,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:32,227 INFO L87 Difference]: Start difference. First operand 88 states and 94 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-02 20:53:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:32,363 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-02 20:53:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:32,364 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-02 20:53:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:32,364 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:53:32,365 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:53:32,365 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-02 20:53:32,365 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:32,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 156 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:53:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-11-02 20:53:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 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-02 20:53:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-02 20:53:32,369 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 49 [2022-11-02 20:53:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:32,369 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-02 20:53:32,369 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-02 20:53:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-02 20:53:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:53:32,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:32,370 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-02 20:53:32,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:53:32,370 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433199, now seen corresponding path program 1 times [2022-11-02 20:53:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:32,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956597043] [2022-11-02 20:53:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:32,801 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-02 20:53:32,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956597043] [2022-11-02 20:53:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956597043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:32,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:32,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246142162] [2022-11-02 20:53:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:32,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:53:32,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:53:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:53:32,804 INFO L87 Difference]: Start difference. First operand 87 states and 93 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-02 20:53:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:33,183 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-11-02 20:53:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:53:33,184 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-02 20:53:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:33,184 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:53:33,184 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:53:33,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:33,185 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 263 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:33,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 380 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:53:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90. [2022-11-02 20:53:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 85 states have internal predecessors, (91), 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-02 20:53:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-02 20:53:33,189 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2022-11-02 20:53:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:33,189 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-02 20:53:33,189 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-02 20:53:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-02 20:53:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:53:33,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:33,192 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-02 20:53:33,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:53:33,193 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2081433198, now seen corresponding path program 1 times [2022-11-02 20:53:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:33,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723224246] [2022-11-02 20:53:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,811 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-02 20:53:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723224246] [2022-11-02 20:53:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723224246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:33,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776584544] [2022-11-02 20:53:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:33,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:53:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:53:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:53:33,813 INFO L87 Difference]: Start difference. First operand 90 states and 97 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-02 20:53:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:34,214 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-11-02 20:53:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:53:34,216 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-02 20:53:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:34,217 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:53:34,217 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:53:34,217 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-02 20:53:34,218 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 270 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:34,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 396 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:53:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-11-02 20:53:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 87 states have internal predecessors, (93), 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-02 20:53:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-11-02 20:53:34,222 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 51 [2022-11-02 20:53:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:34,222 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-11-02 20:53:34,223 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-02 20:53:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-11-02 20:53:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:53:34,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:34,228 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-02 20:53:34,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:53:34,228 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1197458036, now seen corresponding path program 1 times [2022-11-02 20:53:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:34,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851580594] [2022-11-02 20:53:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,989 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-02 20:53:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:34,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851580594] [2022-11-02 20:53:34,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851580594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:34,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495916873] [2022-11-02 20:53:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:34,995 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:35,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:53:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:35,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:53:35,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:35,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:35,885 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3891 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3891)))) is different from true [2022-11-02 20:53:35,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:35,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-02 20:53:35,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:35,995 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-02 20:53:35,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:36,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3896 (Array Int Int)) (|v_node_create_~temp~0#1.base_65| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_65| v_ArrVal_3896) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_65| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-02 20:53:36,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495916873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:36,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:36,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-02 20:53:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028300671] [2022-11-02 20:53:36,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:53:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:53:36,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-02 20:53:36,115 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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-02 20:53:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:36,848 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-11-02 20:53:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:53:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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-02 20:53:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:36,850 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:53:36,850 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:53:36,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=901, Unknown=2, NotChecked=126, Total=1190 [2022-11-02 20:53:36,851 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 325 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:36,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 488 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 342 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2022-11-02 20:53:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:53:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-02 20:53:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 78 states have internal predecessors, (82), 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-02 20:53:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-02 20:53:36,854 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 53 [2022-11-02 20:53:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:36,855 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-02 20:53:36,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 22 states have internal predecessors, (69), 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-02 20:53:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-02 20:53:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:53:36,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:36,856 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-02 20:53:36,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:37,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:37,069 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -422730206, now seen corresponding path program 1 times [2022-11-02 20:53:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572236127] [2022-11-02 20:53:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,941 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-02 20:53:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:37,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572236127] [2022-11-02 20:53:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572236127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:37,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:37,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:53:37,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690620478] [2022-11-02 20:53:37,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:37,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:53:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:37,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:53:37,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:37,945 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-02 20:53:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:38,415 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-02 20:53:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-02 20:53:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:38,422 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:53:38,422 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:53:38,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:53:38,423 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 336 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:38,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 384 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:53:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-11-02 20:53:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 77 states have internal predecessors, (81), 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-02 20:53:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-02 20:53:38,429 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 54 [2022-11-02 20:53:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:38,429 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-02 20:53:38,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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-02 20:53:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-02 20:53:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:53:38,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:38,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-02 20:53:38,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:53:38,431 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -422730205, now seen corresponding path program 1 times [2022-11-02 20:53:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669619916] [2022-11-02 20:53:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:41,122 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-02 20:53:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669619916] [2022-11-02 20:53:41,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669619916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543697917] [2022-11-02 20:53:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:41,127 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:41,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:53:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:41,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:53:41,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:41,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:42,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:42,485 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:53:42,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 20:53:42,513 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:53:42,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-02 20:53:42,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,698 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:53:42,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 [2022-11-02 20:53:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,721 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:53:42,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 38 [2022-11-02 20:53:42,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:42,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:53:42,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:53:42,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-11-02 20:53:43,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-11-02 20:53:43,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:53:43,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:43,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543697917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:43,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [21] total 39 [2022-11-02 20:53:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383456032] [2022-11-02 20:53:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:53:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:53:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1439, Unknown=2, NotChecked=0, Total=1560 [2022-11-02 20:53:43,156 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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-02 20:53:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:43,725 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-02 20:53:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:53:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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 54 [2022-11-02 20:53:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:43,726 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:53:43,726 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:53:43,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=162, Invalid=1906, Unknown=2, NotChecked=0, Total=2070 [2022-11-02 20:53:43,728 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:43,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 641 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2022-11-02 20:53:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:53:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-02 20:53:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 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-02 20:53:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-11-02 20:53:43,730 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2022-11-02 20:53:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:43,730 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-11-02 20:53:43,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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-02 20:53:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-11-02 20:53:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:53:43,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:43,731 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-02 20:53:43,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-02 20:53:43,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:53:43,931 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash -755022309, now seen corresponding path program 1 times [2022-11-02 20:53:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:43,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519495397] [2022-11-02 20:53:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519495397] [2022-11-02 20:53:46,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519495397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633260376] [2022-11-02 20:53:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:46,490 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:46,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:53:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:53:46,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:47,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:47,402 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4620 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4620)))) is different from true [2022-11-02 20:53:47,412 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4621 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4621) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:53:47,420 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4622 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4622)))) is different from true [2022-11-02 20:53:47,429 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4622 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4622)))) is different from true [2022-11-02 20:53:47,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:47,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:47,726 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:53:47,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2022-11-02 20:53:47,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:47,875 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:53:47,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:47,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:47,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:48,062 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:48,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:53:48,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-02 20:53:48,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:48,168 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-02 20:53:48,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 20:53:48,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4627 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-11-02 20:53:48,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4627 (Array Int Int))) (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_$Pointer$.base| .cse0 v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))) is different from false [2022-11-02 20:53:48,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4626))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1)))) is different from false [2022-11-02 20:53:48,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4626))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:53:48,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4626))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:53:48,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4632 (Array Int Int)) (v_ArrVal_4626 (Array Int Int)) (v_ArrVal_4627 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_22| Int)) (or (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_22| v_ArrVal_4632))) (store .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_22|))) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_22| v_ArrVal_4626))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4627) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_22| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:53:48,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633260376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:48,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:48,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 50 [2022-11-02 20:53:48,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776238584] [2022-11-02 20:53:48,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:48,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:53:48,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:48,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:53:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2001, Unknown=10, NotChecked=990, Total=3192 [2022-11-02 20:53:48,305 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 51 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 5 states have call successors, (6), 3 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-02 20:53:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:50,143 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-11-02 20:53:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:53:50,144 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 5 states have call successors, (6), 3 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-02 20:53:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:50,145 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:53:50,145 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:53:50,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=365, Invalid=3571, Unknown=10, NotChecked=1310, Total=5256 [2022-11-02 20:53:50,147 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 404 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:50,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1062 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1398 Invalid, 0 Unknown, 355 Unchecked, 1.0s Time] [2022-11-02 20:53:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:53:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-11-02 20:53:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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-02 20:53:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-02 20:53:50,150 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2022-11-02 20:53:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:50,151 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-02 20:53:50,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 5 states have call successors, (6), 3 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-02 20:53:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-02 20:53:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:53:50,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:50,152 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-02 20:53:50,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:50,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:53:50,358 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -755022308, now seen corresponding path program 1 times [2022-11-02 20:53:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:50,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344057290] [2022-11-02 20:53:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344057290] [2022-11-02 20:53:55,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344057290] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33614117] [2022-11-02 20:53:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:55,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:55,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:55,163 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:55,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:53:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:55,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-02 20:53:55,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:55,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:55,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:56,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:56,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:56,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:56,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:57,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:57,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:57,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:57,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2022-11-02 20:53:57,189 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:53:57,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:57,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:57,695 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:53:57,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:53:57,733 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 20:53:57,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-11-02 20:53:58,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:58,134 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:53:58,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 100 [2022-11-02 20:53:58,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:58,162 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:53:58,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 94 [2022-11-02 20:53:58,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:58,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:53:58,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:58,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 75 [2022-11-02 20:53:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:58,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 71 [2022-11-02 20:53:59,132 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:59,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 84 [2022-11-02 20:53:59,151 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:53:59,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2022-11-02 20:53:59,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 54 [2022-11-02 20:53:59,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 [2022-11-02 20:53:59,785 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-02 20:53:59,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:00,704 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4928 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4928))) (or (forall ((v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4930 (Array Int Int)) (v_ArrVal_4931 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4929))) (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 .cse0 .cse1 v_ArrVal_4931) |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_4930) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0)))) (forall ((v_ArrVal_4928 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4928))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0) (forall ((v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4931 (Array Int Int))) (<= 0 (+ (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4929) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2022-11-02 20:54:00,835 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4924 Int)) (or (not (<= v_ArrVal_4924 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4928 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_4924)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4928))) (or (forall ((v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4930 (Array Int Int)) (v_ArrVal_4931 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4929))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store .cse0 .cse1 v_ArrVal_4931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4930) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0)))))) (forall ((v_ArrVal_4924 Int)) (or (not (<= v_ArrVal_4924 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4928 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_4924)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4928))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0) (forall ((v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4931 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4929) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-02 20:54:01,148 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4928 (Array Int Int)) (v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4924 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4930 (Array Int Int)) (v_ArrVal_4931 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_4924)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4928))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4929))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store .cse0 .cse1 v_ArrVal_4931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4930) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (< |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_4924)))) (forall ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_4928 (Array Int Int)) (v_ArrVal_4929 (Array Int Int)) (v_ArrVal_4924 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_4931 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| v_ArrVal_4924)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4928))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) 0) (< |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_4924) (<= 0 (+ 8 (select (select (store .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4929) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4931) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:54:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33614117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:02,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 52 [2022-11-02 20:54:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081747750] [2022-11-02 20:54:02,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:02,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-02 20:54:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:02,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-02 20:54:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3220, Unknown=5, NotChecked=348, Total=3782 [2022-11-02 20:54:02,069 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:54:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:06,861 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2022-11-02 20:54:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:54:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2022-11-02 20:54:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:06,863 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:54:06,863 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:54:06,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=444, Invalid=5880, Unknown=8, NotChecked=474, Total=6806 [2022-11-02 20:54:06,867 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 158 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 376 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:06,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1165 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1025 Invalid, 0 Unknown, 376 Unchecked, 1.1s Time] [2022-11-02 20:54:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:54:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-11-02 20:54:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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-02 20:54:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-02 20:54:06,871 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 59 [2022-11-02 20:54:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:06,871 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-02 20:54:06,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:54:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-02 20:54:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:54:06,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:06,873 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-02 20:54:06,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:07,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:54:07,090 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:54:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 273036414, now seen corresponding path program 1 times [2022-11-02 20:54:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:07,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725854006] [2022-11-02 20:54:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:11,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:54:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,423 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-02 20:54:13,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:13,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725854006] [2022-11-02 20:54:13,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725854006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:13,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604306793] [2022-11-02 20:54:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:13,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:13,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:13,425 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:13,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:54:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 151 conjunts are in the unsatisfiable core [2022-11-02 20:54:13,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:13,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:13,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:14,259 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:54:14,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:14,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:14,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:54:15,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:15,021 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:54:15,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:15,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 20:54:15,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:15,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:15,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:15,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:15,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:54:16,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:16,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 32 [2022-11-02 20:54:16,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:16,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:16,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:16,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:17,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:17,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:17,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:17,426 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:17,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 65 [2022-11-02 20:54:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:17,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:17,471 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:54:17,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:17,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:54:18,657 INFO L356 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-02 20:54:18,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 110 [2022-11-02 20:54:18,696 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:18,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 [2022-11-02 20:54:18,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:18,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2022-11-02 20:54:18,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:18,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:18,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:18,810 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:18,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 63 [2022-11-02 20:54:18,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:54:18,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:18,932 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:18,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 63 [2022-11-02 20:54:18,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-11-02 20:54:18,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:18,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:19,362 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:19,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 90 treesize of output 71 [2022-11-02 20:54:19,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:19,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:19,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:19,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:19,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2022-11-02 20:54:19,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-11-02 20:54:19,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:19,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:19,927 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-02 20:54:19,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:20,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5257 (Array Int Int)) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5259 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) v_ArrVal_5259)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| v_ArrVal_5257) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:54:20,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5259 Int)) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| (select (select |c_#memory_$Pointer$.offset| |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 ((.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_12| 4) v_ArrVal_5259)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5256) |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_5257) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-02 20:54:20,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5259 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5255))) (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_5254))) (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_5253))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse2 .cse1 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5257) |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_12| (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-02 20:54:20,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5259 Int) (v_ArrVal_5249 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5249) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5255))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5248) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5254))) (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_~last~1#1.base| v_ArrVal_5247) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5253))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse2 .cse1 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse3 .cse1 v_ArrVal_5257) |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_12| (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-02 20:54:20,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5259 Int) (v_ArrVal_5249 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5249) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5255))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| (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_#t~mem12#1.base| v_ArrVal_5248) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5254))) (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_#t~mem12#1.base| v_ArrVal_5247) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5253))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse3 .cse2 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse0 .cse2 v_ArrVal_5257) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-02 20:54:20,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5259 Int) (v_ArrVal_5249 (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_5249) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5255))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5248) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5254))) (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_5247) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5253))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse3 .cse1 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5257) |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_12| (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-02 20:54:20,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5259 Int) (v_ArrVal_5249 (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_5249) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5255))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| (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_5248) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5254))) (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_5247) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5253))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse4 .cse2 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse0 .cse2 v_ArrVal_5257) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))))) is different from false [2022-11-02 20:54:20,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5259 Int) (v_ArrVal_5249 (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_5249) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5255))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| (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_5248) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5254))) (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_5247) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5253))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse4 .cse2 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse0 .cse2 v_ArrVal_5257) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))))) is different from false [2022-11-02 20:54:20,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| Int) (v_ArrVal_5259 Int) (v_ArrVal_5273 (Array Int Int)) (v_ArrVal_5272 (Array Int Int)) (v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5274 (Array Int Int)) (v_ArrVal_5255 (Array Int Int)) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5257 (Array Int Int)) (v_ArrVal_5256 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5247 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_5274)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_5272))) (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_5249) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_5255))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse5 .cse2 v_ArrVal_5248) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_5254))) (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_28| v_ArrVal_5273) .cse2 v_ArrVal_5247) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| v_ArrVal_5253))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_12| 4) v_ArrVal_5259))) (select (select (store .cse3 .cse1 v_ArrVal_5256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_5257) |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_12| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28|) 0)) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_28| |c_#StackHeapBarrier|))))))) is different from false [2022-11-02 20:54:20,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604306793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:20,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:20,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 33] total 71 [2022-11-02 20:54:20,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639247423] [2022-11-02 20:54:20,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:20,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-02 20:54:20,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-02 20:54:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4968, Unknown=18, NotChecked=1350, Total=6642 [2022-11-02 20:54:20,533 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 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-02 20:54:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:24,469 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-11-02 20:54:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:54:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 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 61 [2022-11-02 20:54:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:24,471 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:54:24,471 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:54:24,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=495, Invalid=7178, Unknown=19, NotChecked=1620, Total=9312 [2022-11-02 20:54:24,475 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 182 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:24,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1356 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1676 Invalid, 0 Unknown, 55 Unchecked, 1.7s Time] [2022-11-02 20:54:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:54:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-11-02 20:54:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 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-02 20:54:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-02 20:54:24,480 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 61 [2022-11-02 20:54:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:24,480 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-02 20:54:24,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 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-02 20:54:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-02 20:54:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:54:24,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:24,482 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] [2022-11-02 20:54:24,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:24,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:24,710 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:54:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638346, now seen corresponding path program 1 times [2022-11-02 20:54:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:24,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307941127] [2022-11-02 20:54:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:54:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:31,799 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-02 20:54:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:31,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307941127] [2022-11-02 20:54:31,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307941127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:31,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408394214] [2022-11-02 20:54:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:31,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:31,801 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:31,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:54:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:32,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-02 20:54:32,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:32,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:32,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:33,055 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:54:33,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:33,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:33,542 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:33,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-11-02 20:54:33,875 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:33,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-11-02 20:54:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:33,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 29 [2022-11-02 20:54:34,425 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:54:34,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 27 [2022-11-02 20:54:34,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:34,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:35,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:35,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:35,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:35,197 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:35,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 64 [2022-11-02 20:54:35,247 INFO L356 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-02 20:54:35,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2022-11-02 20:54:36,622 INFO L356 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2022-11-02 20:54:36,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 122 [2022-11-02 20:54:36,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:36,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,730 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:36,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 76 [2022-11-02 20:54:36,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:36,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,873 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:36,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 76 [2022-11-02 20:54:36,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:36,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:37,317 INFO L356 Elim1Store]: treesize reduction 62, result has 34.0 percent of original size [2022-11-02 20:54:37,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 131 treesize of output 85 [2022-11-02 20:54:37,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:37,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:37,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:44,817 INFO L356 Elim1Store]: treesize reduction 92, result has 47.4 percent of original size [2022-11-02 20:54:44,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 296 treesize of output 188 [2022-11-02 20:54:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:49,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:50,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5577 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 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|) (+ |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_5577) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-02 20:54:50,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5577 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 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) (+ |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| .cse1 v_ArrVal_5577) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-02 20:54:53,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5571 (Array Int Int)) (v_ArrVal_5574 (Array Int Int)) (v_ArrVal_5575 (Array Int Int)) (v_ArrVal_5589 (Array Int Int)) (v_ArrVal_5588 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| Int) (v_ArrVal_5570 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5589)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5588))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| 1)) (.cse1 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) 1)) (= (select .cse0 (let ((.cse3 (store (store .cse6 .cse1 v_ArrVal_5570) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5574))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse2 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse5 .cse1 v_ArrVal_5571) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31| v_ArrVal_5575) .cse4 v_ArrVal_5577) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_31|) 0)))))) is different from false [2022-11-02 20:54:53,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408394214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:53,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:53,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 32] total 72 [2022-11-02 20:54:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103999177] [2022-11-02 20:54:53,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:53,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-02 20:54:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-02 20:54:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=6450, Unknown=70, NotChecked=492, Total=7310 [2022-11-02 20:54:53,832 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 73 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 64 states have internal predecessors, (117), 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-02 20:55:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:01,585 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-11-02 20:55:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:55:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 64 states have internal predecessors, (117), 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 65 [2022-11-02 20:55:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:01,587 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:55:01,587 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:55:01,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=619, Invalid=10439, Unknown=84, NotChecked=630, Total=11772 [2022-11-02 20:55:01,589 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:01,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1406 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1836 Invalid, 0 Unknown, 188 Unchecked, 2.2s Time] [2022-11-02 20:55:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:55:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-02 20:55:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 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-02 20:55:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-02 20:55:01,592 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 65 [2022-11-02 20:55:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:01,593 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-02 20:55:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 64 states have internal predecessors, (117), 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-02 20:55:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-02 20:55:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:55:01,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:01,594 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] [2022-11-02 20:55:01,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:01,798 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:55:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1627638347, now seen corresponding path program 1 times [2022-11-02 20:55:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235609123] [2022-11-02 20:55:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:08,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:55:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:10,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235609123] [2022-11-02 20:55:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235609123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:10,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093094152] [2022-11-02 20:55:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:10,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:10,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:10,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:55:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 165 conjunts are in the unsatisfiable core [2022-11-02 20:55:10,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:10,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:11,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:11,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:11,694 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:55:11,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:11,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:55:12,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:12,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:12,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:55:12,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-02 20:55:12,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:12,860 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:12,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:12,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:12,895 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:55:12,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-02 20:55:13,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:13,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:13,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:13,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:13,757 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:55:13,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 46 [2022-11-02 20:55:13,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:13,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:55:13,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:13,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:14,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:14,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02 20:55:14,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:14,631 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:55:14,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 89 [2022-11-02 20:55:14,664 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:55:14,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:14,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:14,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:14,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:55:16,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:16,100 INFO L356 Elim1Store]: treesize reduction 140, result has 15.2 percent of original size [2022-11-02 20:55:16,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 172 treesize of output 91 [2022-11-02 20:55:16,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:55:16,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,449 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:55:16,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 134 treesize of output 102 [2022-11-02 20:55:16,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:55:16,652 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:55:16,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 121 [2022-11-02 20:55:16,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:16,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 47 [2022-11-02 20:55:17,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:17,320 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-11-02 20:55:17,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 8 case distinctions, treesize of input 196 treesize of output 110 [2022-11-02 20:55:17,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:17,382 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-11-02 20:55:17,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 58 treesize of output 59 [2022-11-02 20:55:18,273 INFO L356 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-11-02 20:55:18,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 154 treesize of output 63 [2022-11-02 20:55:18,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:18,679 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:55:18,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-02 20:55:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:18,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:32,023 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (forall ((v_ArrVal_5899 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse1 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_5899)))) (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_5900 Int)) (let ((.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_5900)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse1 .cse2) .cse0)) (select |c_#length| (select (select .cse3 .cse2) .cse0)))))))))))) (not (<= (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (forall ((v_ArrVal_5899 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse12 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse9 (store .cse13 .cse11 (store (select .cse13 .cse11) .cse12 v_ArrVal_5899)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_5900 Int)) (<= 0 (+ 8 (select (select .cse9 (select (select (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8)))))))))) (not (<= (select (select .cse13 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)))))) is different from false [2022-11-02 20:55:32,186 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse8 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse1 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_5899)))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_5900)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (<= 0 .cse3))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| (store .cse8 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse11 (store .cse9 .cse13 (store (select .cse9 .cse13) .cse14 v_ArrVal_5899)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_5900 Int)) (<= 0 (+ (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse10) 8)))))))))))))) is different from false [2022-11-02 20:55:32,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse8 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse2 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_5899)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1)) (forall ((v_ArrVal_5900 Int)) (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_5900)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse1) 12) (select |c_#length| (select (select .cse4 .cse3) .cse1))))))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| (store .cse8 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse11 (store .cse9 .cse13 (store (select .cse9 .cse13) .cse14 v_ArrVal_5899)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_5900 Int)) (<= 0 (+ (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse10) 8)))))))))))))) is different from false [2022-11-02 20:55:32,305 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)))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse1 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_5899)))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_5900)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (<= 0 .cse3))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse11 (store .cse10 .cse13 (store (select .cse10 .cse13) .cse14 v_ArrVal_5899)))) (let ((.cse15 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (<= 0 (+ (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15) 8))) (not (<= 0 .cse15)))))))))))))) is different from false [2022-11-02 20:55:32,375 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse1 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_5899)))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_5900)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (<= 0 .cse3))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse10 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse11 (store .cse10 .cse13 (store (select .cse10 .cse13) .cse14 v_ArrVal_5899)))) (let ((.cse15 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (<= 0 (+ (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15) 8))) (not (<= 0 .cse15)))))))))))))) is different from false [2022-11-02 20:55:32,555 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse8))) (and (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5898))) (or (not (<= (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)) (forall ((v_ArrVal_5899 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5897))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse1 (store .cse0 .cse6 (store (select .cse0 .cse6) .cse7 v_ArrVal_5899)))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_5900 Int)) (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_5900)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ 12 (select (select .cse1 .cse2) .cse3)) (select |c_#length| (select (select .cse4 .cse2) .cse3)))))) (not (<= 0 .cse3))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| Int) (v_ArrVal_5893 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5897 (Array Int Int)) (v_ArrVal_5898 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_5893) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5898))) (or (forall ((v_ArrVal_5899 Int)) (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse8 (store .cse9 |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse14 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16| 4))) (let ((.cse11 (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 v_ArrVal_5899)))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_5900 Int)) (<= 0 (+ 8 (select (select .cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_5900)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse10)))))))))) (not (<= (select (select .cse15 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_16|)))))))) is different from false [2022-11-02 20:55:34,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093094152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:34,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:55:34,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36] total 73 [2022-11-02 20:55:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486557405] [2022-11-02 20:55:34,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-02 20:55:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-02 20:55:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6330, Unknown=14, NotChecked=990, Total=7656 [2022-11-02 20:55:34,024 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 74 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 65 states have internal predecessors, (115), 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-02 20:55:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:41,569 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-02 20:55:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:55:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 65 states have internal predecessors, (115), 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 65 [2022-11-02 20:55:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:41,571 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:55:41,571 INFO L226 Difference]: Without dead ends: 121 [2022-11-02 20:55:41,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=560, Invalid=9752, Unknown=14, NotChecked=1230, Total=11556 [2022-11-02 20:55:41,573 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 133 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:41,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1392 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1519 Invalid, 0 Unknown, 234 Unchecked, 2.1s Time] [2022-11-02 20:55:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-02 20:55:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2022-11-02 20:55:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 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-02 20:55:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2022-11-02 20:55:41,577 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 65 [2022-11-02 20:55:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:41,578 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2022-11-02 20:55:41,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 65 states have internal predecessors, (115), 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-02 20:55:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2022-11-02 20:55:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:55:41,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:41,580 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-02 20:55:41,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:41,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:41,782 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:55:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1082819804, now seen corresponding path program 1 times [2022-11-02 20:55:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:41,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002756157] [2022-11-02 20:55:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:55:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002756157] [2022-11-02 20:55:46,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002756157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:46,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967184313] [2022-11-02 20:55:46,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:46,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:46,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:46,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cc0bf4d-946f-4568-96a1-c7a51e917c64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:55:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-02 20:55:46,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:46,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:46,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:47,220 WARN L833 $PredicateComparison]: unable to prove that (and (< |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_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-02 20:55:47,223 WARN L855 $PredicateComparison]: unable to prove that (and (< |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_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-02 20:55:47,252 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_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-02 20:55:47,255 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_53| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |c_#valid| .cse0)))) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-02 20:55:47,297 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2022-11-02 20:55:47,299 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2022-11-02 20:55:47,330 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 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)) is different from false [2022-11-02 20:55:47,333 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 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)) is different from true [2022-11-02 20:55:47,476 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|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from false [2022-11-02 20:55:47,479 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|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0)) is different from true [2022-11-02 20:55:47,576 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) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2022-11-02 20:55:47,580 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) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2022-11-02 20:55:47,648 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_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2022-11-02 20:55:47,652 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_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2022-11-02 20:55:47,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:55:47,748 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_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-02 20:55:47,753 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_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2022-11-02 20:55:47,887 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:47,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:55:47,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:47,944 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (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_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from false [2022-11-02 20:55:47,949 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (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_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (< |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) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse1 (select |v_#valid_BEFORE_CALL_39| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) is different from true [2022-11-02 20:55:48,021 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))) is different from false [2022-11-02 20:55:48,026 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))) is different from true [2022-11-02 20:55:48,166 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:55:48,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-02 20:55:48,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:48,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:48,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:55:48,316 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse0 (select |v_#valid_BEFORE_CALL_40| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_53| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|)))) is different from true [2022-11-02 20:55:48,396 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (= (select .cse1 0) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_40| .cse0)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2022-11-02 20:55:48,400 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (= (select .cse1 0) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse2 (select |v_#valid_BEFORE_CALL_39| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (< |c_ULTIMATE.start_dll_circular_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_40| .cse0)) (= (select |v_#valid_BEFORE_CALL_40| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2022-11-02 20:55:48,519 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 ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse2 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 .cse1) (= .cse0 (select .cse2 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_40| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| .cse1 1)))))))) is different from false [2022-11-02 20:55:48,524 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 ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse2 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 .cse1) (= .cse0 (select .cse2 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (< .cse1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse3 (select |v_#valid_BEFORE_CALL_39| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (select |v_#valid_BEFORE_CALL_40| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_53| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_53| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_40| .cse0) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_40| .cse1 1)))))))) is different from true [2022-11-02 20:55:48,549 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:55:48,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 29 [2022-11-02 20:55:48,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:48,623 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0)))) is different from false [2022-11-02 20:55:48,628 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0)))) is different from true [2022-11-02 20:55:48,704 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_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 20:55:48,708 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_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 20:55:48,846 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6206 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6206))) (exists ((v_ArrVal_6205 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6205))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 20:55:48,851 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6206 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6206))) (exists ((v_ArrVal_6205 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6205))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 20:55:48,949 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6208 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6207) |c_#memory_$Pointer$.offset|))) is different from false [2022-11-02 20:55:48,953 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_6208 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6208) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_6207 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6207) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:55:49,030 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6209 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6210 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6210))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 20:55:49,034 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6209 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_6209) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_6210 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_6210))) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 20:55:49,108 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6209 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6209) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((v_ArrVal_6210 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6210) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0)))) is different from false [2022-11-02 20:55:49,112 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_6209 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_6209) |c_#memory_$Pointer$.offset|)) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (and (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse0 (select |v_#valid_BEFORE_CALL_39| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1))) (exists ((v_ArrVal_6210 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_6210) |c_#memory_$Pointer$.base|)) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse1 (select |v_#valid_BEFORE_CALL_40| .cse1)))) (< v_arrayElimIndex_48 |c_#StackHeapBarrier|) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0)))) is different from true [2022-11-02 20:55:49,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:49,280 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:55:49,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 116 treesize of output 88 [2022-11-02 20:55:49,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:49,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:49,579 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse3 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse2))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_40| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_39| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))))) is different from false [2022-11-02 20:55:49,585 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse1 (select .cse3 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 2)) (.cse0 (+ 2 .cse2))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse5 (select |v_#valid_BEFORE_CALL_43| .cse5)))) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_40| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_39| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))))))) is different from true [2022-11-02 20:55:49,841 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from false [2022-11-02 20:55:49,848 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from true [2022-11-02 20:55:50,476 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 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|)) (= (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (= |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|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from false [2022-11-02 20:55:50,482 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 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|)) (= (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (= |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|)) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from true [2022-11-02 20:55:50,764 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 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))) (= (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from false [2022-11-02 20:55:50,770 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 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))) (= (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from true [2022-11-02 20:55:51,017 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |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))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from false [2022-11-02 20:55:51,022 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (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) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |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_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |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))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from true [2022-11-02 20:55:51,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:51,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:55:51,225 INFO L356 Elim1Store]: treesize reduction 140, result has 15.2 percent of original size [2022-11-02 20:55:51,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 169 treesize of output 92 [2022-11-02 20:55:51,372 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:55:51,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-02 20:55:51,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:51,482 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (select .cse2 4)) (.cse1 (+ .cse3 2)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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|) (or (= (select .cse2 0) .cse0) (= .cse3 .cse0)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse0 |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse3 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_48))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_40| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_39| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-02 20:55:51,488 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (select .cse2 4)) (.cse1 (+ .cse3 2)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2))) (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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|) (or (= (select .cse2 0) .cse0) (= .cse3 .cse0)) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse0 |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_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse4 (select |v_#valid_BEFORE_CALL_43| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse3 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_48))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse6 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse7 (select |v_#valid_BEFORE_CALL_40| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse8 (select |v_#valid_BEFORE_CALL_39| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-02 20:55:51,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:51,619 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:55:51,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 150 treesize of output 116 [2022-11-02 20:55:51,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:51,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:52,085 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:55:52,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 150 treesize of output 116 [2022-11-02 20:55:52,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:52,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:52,701 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from false [2022-11-02 20:55:52,707 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 |c_#memory_$Pointer$.base| .cse2))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 2)) (.cse1 (select .cse3 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse2) (= .cse1 (select .cse3 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| .cse2) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse1) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_48))) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse4 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse7 (select |v_#valid_BEFORE_CALL_39| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse2 1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse1) 0))))))) is different from true [2022-11-02 20:55:52,926 INFO L356 Elim1Store]: treesize reduction 126, result has 23.6 percent of original size [2022-11-02 20:55:52,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 235 treesize of output 131 [2022-11-02 20:55:52,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:52,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:56:00,273 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (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 .cse9))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse6 (select .cse17 4)) (.cse7 (select .cse17 0))) (or (let ((.cse3 (+ 2 .cse7))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_39| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse6) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse7)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse7) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse6) 0))))) (and .cse1 (let ((.cse15 (select |c_#memory_$Pointer$.base| .cse7))) (or (and (exists ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (v_arrayElimCell_262 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse13 (select .cse17 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ 2 v_arrayElimIndex_48)) (.cse16 (+ .cse13 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_40| .cse12)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse13) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_39| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_39| .cse14)))) (= (select |v_#valid_BEFORE_CALL_43| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= .cse13 (select .cse15 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse7) 0))))) (= .cse6 .cse7)) (let ((.cse18 (+ .cse6 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse19 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= .cse6 (select .cse15 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse7) 1) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_57| .cse7) 0))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)))) is different from false [2022-11-02 20:56:00,283 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (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 .cse9))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse6 (select .cse17 4)) (.cse7 (select .cse17 0))) (or (let ((.cse3 (+ 2 .cse7))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse3 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse5 (select |v_#valid_BEFORE_CALL_39| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse6) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse7)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse7) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse6) 0))))) (and .cse1 (let ((.cse15 (select |c_#memory_$Pointer$.base| .cse7))) (or (and (exists ((|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (v_arrayElimCell_262 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse13 (select .cse17 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse11 (+ 2 v_arrayElimIndex_48)) (.cse16 (+ .cse13 2))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= |v_#valid_BEFORE_CALL_43| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse10 (select |v_#valid_BEFORE_CALL_43| .cse10)))) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse11 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse12 (select |v_#valid_BEFORE_CALL_40| .cse12)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse13) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_39| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse14 (select |v_#valid_BEFORE_CALL_39| .cse14)))) (= (select |v_#valid_BEFORE_CALL_43| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (= .cse13 (select .cse15 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|)) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse11 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (<= .cse16 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse16 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse7) 0))))) (= .cse6 .cse7)) (let ((.cse18 (+ .cse6 2))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse19 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= .cse6 (select .cse15 |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse7) 1) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_57| .cse7) 0))))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)))) is different from true [2022-11-02 20:56:01,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 735 treesize of output 723 [2022-11-02 20:56:04,193 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))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse12 (select .cse11 4)) (.cse3 (select .cse11 0))) (or (and .cse2 (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse4 (select .cse11 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse6 (+ 2 v_prenex_188)) (.cse9 (+ .cse4 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse3) 1) (= .cse4 (select .cse5 v_prenex_186)) (<= .cse6 v_prenex_185) (= (select (store v_prenex_180 .cse1 1) .cse4) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse6 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse7 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse7 (select v_prenex_177 .cse7))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse8 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse8 (select v_prenex_179 .cse8))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse3) 0) (= (select v_prenex_180 .cse1) 0) (<= .cse9 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse10 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse10 (select v_prenex_180 .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse9 v_prenex_187))))) (= .cse12 .cse3)) (let ((.cse15 (+ .cse12 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse14 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse13 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse13 (select v_prenex_176 .cse13))) v_prenex_176) (<= .cse14 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse15 v_prenex_173) (<= .cse14 v_prenex_173) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse16 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse16 (select v_prenex_166 .cse16))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse12 (select .cse5 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse3) 1) (= (select (store v_prenex_167 .cse1 1) .cse12) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse3) 0) (= (let ((.cse17 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse17 (select v_prenex_167 .cse17))) v_prenex_167) (= (select v_prenex_167 .cse1) 0))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (let ((.cse19 (+ 2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) .cse2 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse12) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse3)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse1 1) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse12) 0))))))))))) is different from false [2022-11-02 20:56:04,207 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))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_#t~mem16#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse2 (= |c_ULTIMATE.start_main_#t~mem16#1.offset| 0)) (.cse12 (select .cse11 4)) (.cse3 (select .cse11 0))) (or (and .cse2 (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse4 (select .cse11 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse6 (+ 2 v_prenex_188)) (.cse9 (+ .cse4 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse3) 1) (= .cse4 (select .cse5 v_prenex_186)) (<= .cse6 v_prenex_185) (= (select (store v_prenex_180 .cse1 1) .cse4) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse6 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse7 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse7 (select v_prenex_177 .cse7))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse8 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse8 (select v_prenex_179 .cse8))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse3) 0) (= (select v_prenex_180 .cse1) 0) (<= .cse9 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse10 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse10 (select v_prenex_180 .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse9 v_prenex_187))))) (= .cse12 .cse3)) (let ((.cse15 (+ .cse12 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse14 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse13 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse13 (select v_prenex_176 .cse13))) v_prenex_176) (<= .cse14 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse15 v_prenex_173) (<= .cse14 v_prenex_173) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse16 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse16 (select v_prenex_166 .cse16))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse12 (select .cse5 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse3) 1) (= (select (store v_prenex_167 .cse1 1) .cse12) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse3) 0) (= (let ((.cse17 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse17 (select v_prenex_167 .cse17))) v_prenex_167) (= (select v_prenex_167 .cse1) 0))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (let ((.cse19 (+ 2 .cse3))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) .cse2 (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse12) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse3)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse1 1) .cse3) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse12) 0))))))))))) is different from true [2022-11-02 20:56:06,750 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse12 (select .cse11 4)) (.cse2 (select .cse11 0))) (or (and .cse1 (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse3 (select .cse11 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse5 (+ 2 v_prenex_188)) (.cse9 (+ .cse3 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse2) 1) (= .cse3 (select .cse4 v_prenex_186)) (<= .cse5 v_prenex_185) (= (select (store v_prenex_180 .cse6 1) .cse3) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse5 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse7 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse7 (select v_prenex_177 .cse7))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse8 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse8 (select v_prenex_179 .cse8))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse2) 0) (= (select v_prenex_180 .cse6) 0) (<= .cse9 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse10 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse10 (select v_prenex_180 .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse9 v_prenex_187))))) (= .cse12 .cse2)) (let ((.cse15 (+ .cse12 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse14 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse13 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse13 (select v_prenex_176 .cse13))) v_prenex_176) (<= .cse14 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse15 v_prenex_173) (<= .cse14 v_prenex_173) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse16 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse16 (select v_prenex_166 .cse16))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse12 (select .cse4 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse2) 1) (= (select (store v_prenex_167 .cse6 1) .cse12) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse2) 0) (= (let ((.cse17 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse17 (select v_prenex_167 .cse17))) v_prenex_167) (= (select v_prenex_167 .cse6) 0))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (let ((.cse19 (+ 2 .cse2))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse12) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse2)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse6 1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse12) 0)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse6)))) is different from false [2022-11-02 20:56:06,765 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (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 .cse6))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse12 (select .cse11 4)) (.cse2 (select .cse11 0))) (or (and .cse1 (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse3 (select .cse11 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse5 (+ 2 v_prenex_188)) (.cse9 (+ .cse3 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse2) 1) (= .cse3 (select .cse4 v_prenex_186)) (<= .cse5 v_prenex_185) (= (select (store v_prenex_180 .cse6 1) .cse3) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse5 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse7 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse7 (select v_prenex_177 .cse7))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse8 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse8 (select v_prenex_179 .cse8))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse2) 0) (= (select v_prenex_180 .cse6) 0) (<= .cse9 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse10 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse10 (select v_prenex_180 .cse10)))) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse9 v_prenex_187))))) (= .cse12 .cse2)) (let ((.cse15 (+ .cse12 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse14 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse13 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse13 (select v_prenex_176 .cse13))) v_prenex_176) (<= .cse14 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse15 v_prenex_173) (<= .cse14 v_prenex_173) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse15 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse16 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse16 (select v_prenex_166 .cse16))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse12 (select .cse4 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse2) 1) (= (select (store v_prenex_167 .cse6 1) .cse12) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse2) 0) (= (let ((.cse17 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse17 (select v_prenex_167 .cse17))) v_prenex_167) (= (select v_prenex_167 .cse6) 0))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (let ((.cse19 (+ 2 .cse2))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse12) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse2)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse6 1) .cse2) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse12) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse12) 0)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse6)))) is different from true [2022-11-02 20:56:10,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (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 .cse9))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse6 (select .cse17 0))) (let ((.cse5 (select .cse17 4)) (.cse7 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse6))) (or (let ((.cse2 (+ 2 .cse6))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse5) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse6)) .cse7 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse5) 0))))) (and (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse6))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse10 (select .cse17 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse12 (+ 2 v_prenex_188)) (.cse15 (+ .cse10 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse6) 1) (= .cse10 (select .cse11 v_prenex_186)) (<= .cse12 v_prenex_185) (= (select (store v_prenex_180 .cse9 1) .cse10) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse12 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse13 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse13 (select v_prenex_177 .cse13))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse14 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse14 (select v_prenex_179 .cse14))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse6) 0) (= (select v_prenex_180 .cse9) 0) (<= .cse15 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse16 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse16 (select v_prenex_180 .cse16)))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse15 v_prenex_187))))) (= .cse5 .cse6)) (let ((.cse20 (+ .cse5 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse19 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse18 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse18 (select v_prenex_176 .cse18))) v_prenex_176) (<= .cse19 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse20 v_prenex_173) (<= .cse19 v_prenex_173) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse20 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse21 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse21 (select v_prenex_166 .cse21))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse5 (select .cse11 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse6) 1) (= (select (store v_prenex_167 .cse9 1) .cse5) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse6) 0) (= (let ((.cse22 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse22 (select v_prenex_167 .cse22))) v_prenex_167) (= (select v_prenex_167 .cse9) 0))) (<= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse7)))))))) is different from false [2022-11-02 20:56:10,447 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (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 .cse9))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse17 (select |c_#memory_$Pointer$.base| .cse9))) (let ((.cse6 (select .cse17 0))) (let ((.cse5 (select .cse17 4)) (.cse7 (= |c_ULTIMATE.start_main_#t~mem19#1.base| .cse6))) (or (let ((.cse2 (+ 2 .cse6))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse2 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse3 (select |v_#valid_BEFORE_CALL_40| .cse3)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse4 (select |v_#valid_BEFORE_CALL_39| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse5) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse6)) .cse7 (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse8 (select |v_#valid_BEFORE_CALL_43| .cse8)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse9 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse5) 0))))) (and (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse6))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse10 (select .cse17 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse12 (+ 2 v_prenex_188)) (.cse15 (+ .cse10 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse6) 1) (= .cse10 (select .cse11 v_prenex_186)) (<= .cse12 v_prenex_185) (= (select (store v_prenex_180 .cse9 1) .cse10) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse12 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse13 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse13 (select v_prenex_177 .cse13))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse14 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse14 (select v_prenex_179 .cse14))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse6) 0) (= (select v_prenex_180 .cse9) 0) (<= .cse15 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse16 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse16 (select v_prenex_180 .cse16)))) (<= .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse15 v_prenex_187))))) (= .cse5 .cse6)) (let ((.cse20 (+ .cse5 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse19 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse18 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse18 (select v_prenex_176 .cse18))) v_prenex_176) (<= .cse19 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse20 v_prenex_173) (<= .cse19 v_prenex_173) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse20 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse21 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse21 (select v_prenex_166 .cse21))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse5 (select .cse11 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse6) 1) (= (select (store v_prenex_167 .cse9 1) .cse5) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse6) 0) (= (let ((.cse22 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse22 (select v_prenex_167 .cse22))) v_prenex_167) (= (select v_prenex_167 .cse9) 0))) (<= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse7)))))))) is different from true [2022-11-02 20:56:12,969 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))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse1 (select .cse10 0))) (let ((.cse17 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (.cse11 (select .cse10 4))) (or (and (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse2 (select .cse10 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse4 (+ 2 v_prenex_188)) (.cse8 (+ .cse2 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse1) 1) (= .cse2 (select .cse3 v_prenex_186)) (<= .cse4 v_prenex_185) (= (select (store v_prenex_180 .cse5 1) .cse2) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse4 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse6 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse6 (select v_prenex_177 .cse6))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse7 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse7 (select v_prenex_179 .cse7))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse1) 0) (= (select v_prenex_180 .cse5) 0) (<= .cse8 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse9 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse9 (select v_prenex_180 .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse8 v_prenex_187))))) (= .cse11 .cse1)) (let ((.cse14 (+ .cse11 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse13 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse12 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse12 (select v_prenex_176 .cse12))) v_prenex_176) (<= .cse13 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse14 v_prenex_173) (<= .cse13 v_prenex_173) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse14 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse15 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse15 (select v_prenex_166 .cse15))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse11 (select .cse3 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse1) 1) (= (select (store v_prenex_167 .cse5 1) .cse11) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse1) 0) (= (let ((.cse16 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse16 (select v_prenex_167 .cse16))) v_prenex_167) (= (select v_prenex_167 .cse5) 0))) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse17) (let ((.cse19 (+ 2 .cse1))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse11) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse1)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse17 (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse5 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse11) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse11) 0)))))))))))) is different from false [2022-11-02 20:56:12,984 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))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse1 (select .cse10 0))) (let ((.cse17 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (.cse11 (select .cse10 4))) (or (and (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (and (exists ((v_prenex_180 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| Int) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_prenex_187 Int) (v_prenex_188 Int) (v_prenex_185 Int) (v_prenex_186 Int) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse2 (select .cse10 (+ |ULTIMATE.start_dll_circular_append_#t~mem14#1.offset| 4)))) (let ((.cse4 (+ 2 v_prenex_188)) (.cse8 (+ .cse2 2))) (and (= (select v_prenex_183 v_prenex_181) 0) (= (select v_prenex_180 .cse1) 1) (= .cse2 (select .cse3 v_prenex_186)) (<= .cse4 v_prenex_185) (= (select (store v_prenex_180 .cse5 1) .cse2) 0) (= (select v_prenex_179 v_prenex_182) 1) (<= .cse4 v_prenex_187) (= (select v_prenex_183 v_prenex_185) 1) (= (let ((.cse6 (@diff v_prenex_183 v_prenex_177))) (store v_prenex_183 .cse6 (select v_prenex_177 .cse6))) v_prenex_177) (<= .cse0 v_prenex_187) (= (select v_prenex_179 v_prenex_188) 0) (= (select v_prenex_178 v_prenex_187) 1) (= (let ((.cse7 (@diff v_prenex_178 v_prenex_179))) (store v_prenex_178 .cse7 (select v_prenex_179 .cse7))) v_prenex_179) (= (select v_prenex_177 v_prenex_181) 1) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 .cse1) 0) (= (select v_prenex_180 .cse5) 0) (<= .cse8 v_prenex_185) (= (select v_prenex_178 v_prenex_182) 0) (= v_prenex_180 (let ((.cse9 (@diff v_prenex_184 v_prenex_180))) (store v_prenex_184 .cse9 (select v_prenex_180 .cse9)))) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select v_prenex_184 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse0 v_prenex_185) (<= .cse8 v_prenex_187))))) (= .cse11 .cse1)) (let ((.cse14 (+ .cse11 2))) (and (exists ((v_prenex_169 Int) (v_prenex_171 (Array Int Int)) (v_prenex_168 Int) (v_prenex_165 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_prenex_174 Int) (v_prenex_175 Int) (v_prenex_166 (Array Int Int)) (v_prenex_173 Int)) (let ((.cse13 (+ 2 v_prenex_174))) (and (= (select v_prenex_165 v_prenex_169) 0) (= (select v_prenex_171 v_prenex_168) 0) (= (let ((.cse12 (@diff v_prenex_171 v_prenex_176))) (store v_prenex_171 .cse12 (select v_prenex_176 .cse12))) v_prenex_176) (<= .cse13 v_prenex_175) (= (select v_prenex_166 v_prenex_174) 0) (= (select v_prenex_171 v_prenex_175) 1) (<= .cse14 v_prenex_173) (<= .cse13 v_prenex_173) (<= .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse14 v_prenex_175) (<= .cse0 v_prenex_175) (= (let ((.cse15 (@diff v_prenex_165 v_prenex_166))) (store v_prenex_165 .cse15 (select v_prenex_166 .cse15))) v_prenex_166) (= (select v_prenex_166 v_prenex_169) 1) (= (select v_prenex_165 v_prenex_173) 1) (<= .cse0 v_prenex_173) (= (select v_prenex_176 v_prenex_168) 1)))) (exists ((v_prenex_170 Int)) (= .cse11 (select .cse3 v_prenex_170))) (exists ((v_prenex_172 (Array Int Int)) (v_prenex_167 (Array Int Int))) (and (= (select v_prenex_167 .cse1) 1) (= (select (store v_prenex_167 .cse5 1) .cse11) 0) (= (select v_prenex_172 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select v_prenex_172 .cse1) 0) (= (let ((.cse16 (@diff v_prenex_172 v_prenex_167))) (store v_prenex_172 .cse16 (select v_prenex_167 .cse16))) v_prenex_167) (= (select v_prenex_167 .cse5) 0))) (<= .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))))) .cse17) (let ((.cse19 (+ 2 .cse1))) (and (exists ((|v_old(#valid)_AFTER_CALL_53| (Array Int Int)) (|v_#valid_BEFORE_CALL_40| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13| Int) (|v_old(#valid)_AFTER_CALL_55| (Array Int Int)) (v_arrayElimCell_262 Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15| Int) (v_arrayElimIndex_48 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34| Int)) (let ((.cse18 (+ 2 v_arrayElimIndex_48))) (and (= (select |v_old(#valid)_AFTER_CALL_53| v_arrayElimCell_262) 0) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_262) 1) (<= .cse18 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse19 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_40| (let ((.cse20 (@diff |v_old(#valid)_AFTER_CALL_53| |v_#valid_BEFORE_CALL_40|))) (store |v_old(#valid)_AFTER_CALL_53| .cse20 (select |v_#valid_BEFORE_CALL_40| .cse20)))) (= 1 (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|)) (<= .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= .cse19 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= |v_#valid_BEFORE_CALL_39| (let ((.cse21 (@diff |v_old(#valid)_AFTER_CALL_55| |v_#valid_BEFORE_CALL_39|))) (store |v_old(#valid)_AFTER_CALL_55| .cse21 (select |v_#valid_BEFORE_CALL_39| .cse21)))) (= (select |v_old(#valid)_AFTER_CALL_53| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimIndex_48) 0) (= (select |v_old(#valid)_AFTER_CALL_55| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 0) (<= .cse18 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_34|) (= (select |v_#valid_BEFORE_CALL_39| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_BEFORE_CALL_13|) 1)))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= (select (select |c_#memory_$Pointer$.base| .cse11) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) .cse1)) (<= .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) .cse17 (exists ((|v_#valid_BEFORE_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_43| (let ((.cse22 (@diff |v_old(#valid)_AFTER_CALL_57| |v_#valid_BEFORE_CALL_43|))) (store |v_old(#valid)_AFTER_CALL_57| .cse22 (select |v_#valid_BEFORE_CALL_43| .cse22)))) (= (select (store |v_#valid_BEFORE_CALL_43| .cse5 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_43| .cse11) 1) (= (select |v_#valid_BEFORE_CALL_43| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_57| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_57| .cse11) 0)))))))))))) is different from true [2022-11-02 20:56:14,000 INFO L356 Elim1Store]: treesize reduction 172, result has 22.9 percent of original size [2022-11-02 20:56:14,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 752 treesize of output 509