./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:54:10,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:54:10,683 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:54:10,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:54:10,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:54:10,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:54:10,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:54:10,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:54:10,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:54:10,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:54:10,750 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:54:10,751 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:54:10,752 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:54:10,754 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:54:10,754 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:54:10,755 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:54:10,755 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:54:10,755 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:54:10,756 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:54:10,757 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:54:10,757 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:54:10,758 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:54:10,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:54:10,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:54:10,760 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:54:10,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:54:10,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:54:10,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:54:10,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:54:10,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:54:10,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:54:10,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:54:10,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:54:10,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:54:10,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:54:10,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:54:10,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:54:10,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:54:10,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:54:10,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:54:10,777 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:54:10,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:54:10,779 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:54:10,779 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:54:10,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:54:10,780 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/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_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-12 00:54:11,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:54:11,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:54:11,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:54:11,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:54:11,158 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:54:11,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-12 00:54:14,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:54:14,497 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:54:14,498 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-12 00:54:14,513 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/data/19fa4f15f/e7576958beb44241bcb6407d7b1c1d11/FLAG5acaea3ba [2023-11-12 00:54:14,534 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/data/19fa4f15f/e7576958beb44241bcb6407d7b1c1d11 [2023-11-12 00:54:14,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:54:14,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:54:14,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:54:14,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:54:14,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:54:14,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:14" (1/1) ... [2023-11-12 00:54:14,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c50fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:14, skipping insertion in model container [2023-11-12 00:54:14,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:54:14" (1/1) ... [2023-11-12 00:54:14,595 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:54:14,963 WARN L240 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_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-12 00:54:14,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:54:14,984 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:54:15,030 WARN L240 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_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-12 00:54:15,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:54:15,065 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:54:15,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15 WrapperNode [2023-11-12 00:54:15,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:54:15,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:54:15,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:54:15,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:54:15,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,113 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-11-12 00:54:15,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:54:15,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:54:15,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:54:15,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:54:15,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:54:15,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:54:15,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:54:15,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:54:15,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (1/1) ... [2023-11-12 00:54:15,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:54:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:15,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:54:15,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:54:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:54:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:54:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:54:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:54:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:54:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:54:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:54:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:54:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:54:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:54:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:54:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:54:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:54:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:54:15,439 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:54:15,441 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:54:15,643 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:54:15,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:54:15,696 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:54:15,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:15 BoogieIcfgContainer [2023-11-12 00:54:15,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:54:15,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:54:15,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:54:15,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:54:15,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:54:14" (1/3) ... [2023-11-12 00:54:15,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754bce48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:15, skipping insertion in model container [2023-11-12 00:54:15,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:54:15" (2/3) ... [2023-11-12 00:54:15,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754bce48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:54:15, skipping insertion in model container [2023-11-12 00:54:15,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:54:15" (3/3) ... [2023-11-12 00:54:15,709 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-12 00:54:15,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:54:15,726 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:54:15,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:54:15,784 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2539e5e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:54:15,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:54:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:54:15,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:15,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:15,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:15,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1235008322, now seen corresponding path program 1 times [2023-11-12 00:54:15,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693903173] [2023-11-12 00:54:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:16,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693903173] [2023-11-12 00:54:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693903173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:54:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269318005] [2023-11-12 00:54:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:54:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:54:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:16,365 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-12 00:54:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:16,425 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-11-12 00:54:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:54:16,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-12 00:54:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:16,436 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:54:16,436 INFO L226 Difference]: Without dead ends: 17 [2023-11-12 00:54:16,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:54:16,447 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:16,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:54:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-12 00:54:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-11-12 00:54:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-12 00:54:16,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-12 00:54:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:16,508 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-12 00:54:16,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-12 00:54:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-12 00:54:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:54:16,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:16,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:16,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:54:16,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:16,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -908152313, now seen corresponding path program 1 times [2023-11-12 00:54:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425144741] [2023-11-12 00:54:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:16,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425144741] [2023-11-12 00:54:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425144741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777447293] [2023-11-12 00:54:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:16,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:16,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:16,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:54:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:16,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:54:16,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:16,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777447293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:54:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [678959655] [2023-11-12 00:54:17,029 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:54:17,029 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:17,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:17,040 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:17,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:19,657 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-12 00:54:19,954 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:27,343 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '187#(and (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_14| Int) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| Int) (|v_#memory_int_19| (Array Int (Array Int Int)))) (and (<= 2 |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (= (store (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |#memory_$Pointer$.base|) (<= 2 |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) (or (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|))) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))) (= |v_#memory_int_19| (store |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_19| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 0))))) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:54:27,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:54:27,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:27,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 00:54:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093005808] [2023-11-12 00:54:27,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:27,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:54:27,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:54:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2023-11-12 00:54:27,354 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:54:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:27,419 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-12 00:54:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:54:27,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2023-11-12 00:54:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:27,422 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:54:27,422 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 00:54:27,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2023-11-12 00:54:27,425 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:27,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:54:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 00:54:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-12 00:54:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2023-11-12 00:54:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-12 00:54:27,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2023-11-12 00:54:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:27,434 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-12 00:54:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:54:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-12 00:54:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:54:27,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:27,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:27,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:27,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:27,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:27,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1199292684, now seen corresponding path program 2 times [2023-11-12 00:54:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575717480] [2023-11-12 00:54:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:54:28,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575717480] [2023-11-12 00:54:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575717480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:28,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 00:54:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098050441] [2023-11-12 00:54:28,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:28,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:54:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:54:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:54:28,649 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:28,849 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-12 00:54:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:54:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-12 00:54:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:28,855 INFO L225 Difference]: With dead ends: 25 [2023-11-12 00:54:28,855 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:54:28,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-12 00:54:28,857 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:28,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:54:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-12 00:54:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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) [2023-11-12 00:54:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-12 00:54:28,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-12 00:54:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:28,870 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-12 00:54:28,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-12 00:54:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:54:28,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:28,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:54:28,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:28,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1199347709, now seen corresponding path program 1 times [2023-11-12 00:54:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751186935] [2023-11-12 00:54:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:54:29,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751186935] [2023-11-12 00:54:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751186935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:54:29,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:54:29,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:54:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551259212] [2023-11-12 00:54:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:54:29,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:54:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:54:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:54:29,190 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:29,267 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-11-12 00:54:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:54:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-12 00:54:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:29,269 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:54:29,269 INFO L226 Difference]: Without dead ends: 20 [2023-11-12 00:54:29,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:54:29,271 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:29,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:54:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-12 00:54:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-12 00:54:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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) [2023-11-12 00:54:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-12 00:54:29,279 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2023-11-12 00:54:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:29,280 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-12 00:54:29,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:54:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-12 00:54:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:54:29,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:29,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:29,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:54:29,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:29,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1469067847, now seen corresponding path program 1 times [2023-11-12 00:54:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214670219] [2023-11-12 00:54:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:31,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214670219] [2023-11-12 00:54:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214670219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087754236] [2023-11-12 00:54:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:31,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:31,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:31,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:31,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:54:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:31,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-12 00:54:31,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:31,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:54:31,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:31,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:54:31,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-11-12 00:54:31,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:54:31,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 00:54:32,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:54:32,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-11-12 00:54:32,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2023-11-12 00:54:32,187 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-12 00:54:32,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-12 00:54:32,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 00:54:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-12 00:54:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2023-11-12 00:54:32,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 35 [2023-11-12 00:54:32,615 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:32,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2023-11-12 00:54:32,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:32,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 00:54:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:32,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087754236] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1304302143] [2023-11-12 00:54:34,266 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:54:34,266 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:34,267 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:34,267 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:34,267 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:35,633 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-12 00:54:35,890 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:39,880 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '534#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:54:39,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:54:39,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:54:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-11-12 00:54:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433866100] [2023-11-12 00:54:39,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 00:54:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:39,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 00:54:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1529, Unknown=2, NotChecked=0, Total=1640 [2023-11-12 00:54:39,885 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:54:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:40,950 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-12 00:54:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:54:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-12 00:54:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:40,958 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:54:40,958 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:54:40,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=148, Invalid=2012, Unknown=2, NotChecked=0, Total=2162 [2023-11-12 00:54:40,967 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:40,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:54:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:54:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-11-12 00:54:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2023-11-12 00:54:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-11-12 00:54:40,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 24 [2023-11-12 00:54:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:40,986 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-11-12 00:54:40,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:54:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-11-12 00:54:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:54:40,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:40,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:41,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:41,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:41,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:41,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1469122872, now seen corresponding path program 1 times [2023-11-12 00:54:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803387568] [2023-11-12 00:54:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:42,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803387568] [2023-11-12 00:54:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803387568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685465250] [2023-11-12 00:54:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:42,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:42,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:54:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:42,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-12 00:54:42,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:42,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 00:54:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:42,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 00:54:42,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:42,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 16 [2023-11-12 00:54:42,643 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:42,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-11-12 00:54:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:54:42,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:42,693 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:42,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1194 treesize of output 1193 [2023-11-12 00:54:42,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 964 [2023-11-12 00:54:42,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-12 00:54:42,820 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-12 00:54:42,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-12 00:54:42,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 182 [2023-11-12 00:54:42,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2023-11-12 00:54:43,413 INFO L322 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-12 00:54:43,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2023-11-12 00:54:43,445 INFO L322 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-12 00:54:43,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2023-11-12 00:54:43,477 INFO L322 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-12 00:54:43,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2023-11-12 00:54:43,508 INFO L322 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-11-12 00:54:43,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2023-11-12 00:54:43,535 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_517 (Array Int Int)) (v_arrayElimCell_27 Int)) (not (= (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store v_ArrVal_517 4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27)) 0)))) (.cse2 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse3 (not .cse0)) (.cse9 (not .cse4)) (.cse11 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_sll_prepend_~head#1.base| 1)))) (and (or .cse0 .cse1 .cse2) (or .cse3 (and (or .cse4 (forall ((v_ArrVal_517 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int) (v_arrayElimCell_31 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_517 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_517) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_31)) 0)) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (forall ((v_ArrVal_517 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_517 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_517) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|))) .cse9))) (or .cse0 (and (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_1))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_29)) 0)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| (select v_arrayElimArr_1 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) .cse11) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (or (forall ((v_ArrVal_517 (Array Int Int)) (v_arrayElimCell_28 Int)) (not (= (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_517 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_517) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse13 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_28)) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or .cse1 .cse2))) (or (and (or .cse3 (and (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (not (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_4))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) .cse9) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (not (= (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_3))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27)) 0)))) .cse4))) (or .cse0 (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_arrayElimArr_2))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_30)) 0)) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| (select v_arrayElimArr_2 |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))))) .cse11) (or .cse0 (forall ((v_ArrVal_517 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int) (v_arrayElimCell_32 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (select (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_517 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_517) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse18 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_32)) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) (= |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| |c_ULTIMATE.start_main_~#s~0#1.base|))))))) is different from false [2023-11-12 00:54:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685465250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:43,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1254976715] [2023-11-12 00:54:43,597 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-12 00:54:43,597 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:43,597 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:43,598 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:43,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:44,956 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-12 00:54:45,125 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:48,608 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '740#(and (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |ULTIMATE.start_main_~count~0#1| 3)) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:54:48,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:54:48,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:54:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-11-12 00:54:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113504465] [2023-11-12 00:54:48,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:48,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:54:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:48,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:54:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1154, Unknown=2, NotChecked=68, Total=1332 [2023-11-12 00:54:48,611 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:54:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:49,062 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-12 00:54:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:54:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-12 00:54:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:49,064 INFO L225 Difference]: With dead ends: 25 [2023-11-12 00:54:49,064 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:54:49,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=4, NotChecked=82, Total=1892 [2023-11-12 00:54:49,066 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:49,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:54:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:54:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-12 00:54:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2023-11-12 00:54:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-12 00:54:49,073 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2023-11-12 00:54:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:49,074 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-12 00:54:49,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:54:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-12 00:54:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:54:49,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:49,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:49,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:49,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:54:49,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:54:49,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1270005566, now seen corresponding path program 2 times [2023-11-12 00:54:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806449301] [2023-11-12 00:54:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:54:52,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806449301] [2023-11-12 00:54:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806449301] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865466360] [2023-11-12 00:54:52,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:54:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:52,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:52,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cec7dbb1-2307-46d8-bc82-b97d60f9bf4b/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:54:52,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:54:52,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:54:52,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 160 conjunts are in the unsatisfiable core [2023-11-12 00:54:52,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:52,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:54:52,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:54:53,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:53,133 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:54:53,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 00:54:53,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:54:53,350 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:53,475 WARN L854 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| .cse1) (= (store |v_#memory_int_BEFORE_CALL_58| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (select (select |v_#memory_int_BEFORE_CALL_58| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2023-11-12 00:54:53,478 WARN L876 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_sll_create_#t~ret5#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_create_#t~ret5#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (or (exists ((|v_#memory_int_BEFORE_CALL_58| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_58| |c_#memory_int|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret5#1.base| .cse1) (= (store |v_#memory_int_BEFORE_CALL_58| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (select (select |v_#memory_int_BEFORE_CALL_58| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from true [2023-11-12 00:54:53,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 00:54:53,538 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:54:53,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-12 00:54:53,580 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:53,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from false [2023-11-12 00:54:53,602 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_int| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2023-11-12 00:54:53,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_int| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_60| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-12 00:54:53,696 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_int| .cse1) 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_60| |c_#valid|))) (store |v_#valid_BEFORE_CALL_60| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_60| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-12 00:54:53,753 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:54:53,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 46 [2023-11-12 00:54:53,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:54:53,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:53,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-12 00:54:53,829 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2023-11-12 00:54:53,832 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2023-11-12 00:54:53,896 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-12 00:54:53,899 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-12 00:54:53,974 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|)) is different from false [2023-11-12 00:54:53,978 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (and (= |v_#valid_BEFORE_CALL_61| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_60| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_60| .cse0 (select |v_#valid_BEFORE_CALL_61| .cse0)))) (= (select |v_#valid_BEFORE_CALL_60| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= (+ v_arrayElimIndex_3 1) |c_#StackHeapBarrier|) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_3) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimCell_45) 1))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| (select |c_#memory_int| |c_node_create_#res#1.base|)) |c_#memory_int|)) is different from true [2023-11-12 00:54:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,097 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 00:54:54,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 83 [2023-11-12 00:54:54,125 INFO L322 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-12 00:54:54,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2023-11-12 00:54:54,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,241 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:54:54,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-11-12 00:54:54,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse4 2)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (let ((.cse2 (+ v_arrayElimIndex_3 2))) (and (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (= |v_#valid_BEFORE_CALL_61| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse1 (select |v_#valid_BEFORE_CALL_61| .cse1)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_60| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_35| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse6 (select |v_old(#valid)_AFTER_CALL_35| .cse6))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse5 .cse4) (= (select (select |c_#memory_int| .cse5) 0) 1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2023-11-12 00:54:54,289 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse4 2)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse4) 4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (v_arrayElimCell_45 Int)) (let ((.cse2 (+ v_arrayElimIndex_3 2))) (and (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (= |v_#valid_BEFORE_CALL_61| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse1 (select |v_#valid_BEFORE_CALL_61| .cse1)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_60| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_35| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse6 (select |v_old(#valid)_AFTER_CALL_35| .cse6))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse5 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= .cse5 .cse4) (= (select (select |c_#memory_int| .cse5) 0) 1)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2023-11-12 00:54:54,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 48 [2023-11-12 00:54:54,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,465 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-12 00:54:54,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 84 [2023-11-12 00:54:54,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:54,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2023-11-12 00:54:55,175 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (+ 2 .cse6)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse2 (+ .cse0 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse6) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse0) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2023-11-12 00:54:55,179 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse1 (+ 2 .cse6)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse2 (+ .cse0 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse6) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse0) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2023-11-12 00:54:55,380 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (let ((.cse1 (+ 2 .cse0)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse2 (+ .cse6 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-12 00:54:55,385 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (let ((.cse1 (+ 2 .cse0)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse2 (+ .cse6 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse0) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-12 00:54:55,600 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse1 (+ .cse6 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0))))))) is different from false [2023-11-12 00:54:55,605 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4))) (let ((.cse0 (+ 2 .cse2)) (.cse4 (+ v_arrayElimIndex_3 2)) (.cse1 (+ .cse6 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (and (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select (select |c_#memory_int| .cse3) 0) 1) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse5 (select |v_#valid_BEFORE_CALL_61| .cse5)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_#valid_BEFORE_CALL_60| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_60| .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| .cse6) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse7 (select |v_old(#valid)_AFTER_CALL_35| .cse7))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_old(#valid)_AFTER_CALL_35| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0))))))) is different from true [2023-11-12 00:54:55,686 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:54:55,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 75 [2023-11-12 00:54:55,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:55,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:55,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:55,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2023-11-12 00:54:55,885 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (+ v_arrayElimIndex_7 2)) (.cse3 (+ v_arrayElimIndex_6 2)) (.cse1 (+ v_arrayElimIndex_3 2))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse2 (select |v_#valid_BEFORE_CALL_61| .cse2)))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_6) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse4 (select |v_old(#valid)_AFTER_CALL_35| .cse4))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_7) 0) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2023-11-12 00:54:55,890 WARN L876 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (+ v_arrayElimIndex_7 2)) (.cse3 (+ v_arrayElimIndex_6 2)) (.cse1 (+ v_arrayElimIndex_3 2))) (and (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse2 (select |v_#valid_BEFORE_CALL_61| .cse2)))) (not (= |c_ULTIMATE.start_main_~temp~2#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_6) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~temp~2#1.base|) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse4 (select |v_old(#valid)_AFTER_CALL_35| .cse4))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_7) 0) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2023-11-12 00:54:56,064 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (+ v_arrayElimIndex_7 2)) (.cse3 (+ v_arrayElimIndex_6 2)) (.cse1 (+ v_arrayElimIndex_3 2))) (and (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse2 (select |v_#valid_BEFORE_CALL_61| .cse2)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_6) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_6) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse4 (select |v_old(#valid)_AFTER_CALL_35| .cse4))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_7) 0) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2023-11-12 00:54:56,069 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_61| (Array Int Int)) (|v_#valid_BEFORE_CALL_60| (Array Int Int)) (v_arrayElimIndex_7 Int) (|v_#valid_BEFORE_CALL_63| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_45 Int)) (let ((.cse0 (+ v_arrayElimIndex_7 2)) (.cse3 (+ v_arrayElimIndex_6 2)) (.cse1 (+ v_arrayElimIndex_3 2))) (and (= (select |v_#valid_BEFORE_CALL_60| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimCell_45) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= |v_#valid_BEFORE_CALL_61| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_63| |v_#valid_BEFORE_CALL_61|))) (store |v_#valid_BEFORE_CALL_63| .cse2 (select |v_#valid_BEFORE_CALL_61| .cse2)))) (= (select |v_#valid_BEFORE_CALL_63| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) 1) (<= .cse0 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_61| v_arrayElimIndex_3) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_6) 1) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12| v_arrayElimCell_45)) (= (select |v_#valid_BEFORE_CALL_60| v_arrayElimIndex_6) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_60| |v_old(#valid)_AFTER_CALL_35|))) (store |v_#valid_BEFORE_CALL_60| .cse4 (select |v_old(#valid)_AFTER_CALL_35| .cse4))) |v_old(#valid)_AFTER_CALL_35|) (= (select |v_#valid_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_35| v_arrayElimIndex_7) 0) (<= .cse3 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (<= .cse1 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_12|) (= (select |v_#valid_BEFORE_CALL_63| v_arrayElimIndex_3) 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2023-11-12 00:54:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-11-12 00:54:56,153 INFO L327 TraceCheckSpWp]: Computing backward predicates...