./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:42:48,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:42:48,171 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:42:48,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:42:48,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:42:48,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:42:48,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:42:48,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:42:48,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:42:48,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:42:48,203 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:42:48,204 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:42:48,204 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:42:48,205 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:42:48,205 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:42:48,206 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:42:48,206 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:42:48,207 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:42:48,207 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:42:48,208 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:42:48,209 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:42:48,212 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:42:48,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:42:48,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:42:48,214 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:42:48,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:42:48,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:42:48,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:42:48,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:42:48,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:42:48,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:42:48,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:42:48,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:42:48,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:42:48,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:42:48,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:42:48,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:42:48,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:42:48,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:42:48,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:42:48,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:42:48,219 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:42:48,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:42:48,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:42:48,220 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:42:48,220 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:42:48,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:42:48,220 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_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/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_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-12-02 12:42:48,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:42:48,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:42:48,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:42:48,464 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:42:48,465 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:42:48,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-12-02 12:42:51,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:42:51,536 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:42:51,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-12-02 12:42:51,551 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/data/a773afd8e/41c28a7fe2514208a09e44190e0ead58/FLAGaaa57b4d3 [2023-12-02 12:42:51,565 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/data/a773afd8e/41c28a7fe2514208a09e44190e0ead58 [2023-12-02 12:42:51,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:42:51,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:42:51,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:42:51,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:42:51,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:42:51,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:51,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419a3ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51, skipping insertion in model container [2023-12-02 12:42:51,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:51,622 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:42:51,876 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_7fbe8657-485e-4bf2-956d-06bba2ceddc9/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-12-02 12:42:51,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:42:51,889 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:42:51,928 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_7fbe8657-485e-4bf2-956d-06bba2ceddc9/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2023-12-02 12:42:51,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:42:51,959 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:42:51,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51 WrapperNode [2023-12-02 12:42:51,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:42:51,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:42:51,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:42:51,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:42:51,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:51,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,006 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2023-12-02 12:42:52,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:42:52,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:42:52,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:42:52,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:42:52,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:42:52,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:42:52,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:42:52,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:42:52,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (1/1) ... [2023-12-02 12:42:52,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:42:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:42:52,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:42:52,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:42:52,104 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-02 12:42:52,104 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-02 12:42:52,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:42:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:42:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:42:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:42:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:42:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:42:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:42:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:42:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:42:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:42:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:42:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:42:52,209 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:42:52,211 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:42:52,240 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-02 12:42:52,417 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:42:52,505 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:42:52,506 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 12:42:52,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:42:52 BoogieIcfgContainer [2023-12-02 12:42:52,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:42:52,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:42:52,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:42:52,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:42:52,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:42:51" (1/3) ... [2023-12-02 12:42:52,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ded554b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:42:52, skipping insertion in model container [2023-12-02 12:42:52,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:42:51" (2/3) ... [2023-12-02 12:42:52,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ded554b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:42:52, skipping insertion in model container [2023-12-02 12:42:52,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:42:52" (3/3) ... [2023-12-02 12:42:52,518 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-12-02 12:42:52,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:42:52,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:42:52,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:42:52,592 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;@ffc6b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:42:52,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:42:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 12:42:52,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:52,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:42:52,604 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:42:52,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1801499726, now seen corresponding path program 1 times [2023-12-02 12:42:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989131911] [2023-12-02 12:42:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:52,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:42:52,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989131911] [2023-12-02 12:42:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989131911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:42:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:42:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:42:52,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708733356] [2023-12-02 12:42:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:42:52,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:42:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:42:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:42:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:42:52,994 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:53,082 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-12-02 12:42:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:42:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 12:42:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:53,091 INFO L225 Difference]: With dead ends: 35 [2023-12-02 12:42:53,092 INFO L226 Difference]: Without dead ends: 14 [2023-12-02 12:42:53,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:42:53,098 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:53,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:42:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-02 12:42:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-12-02 12:42:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-02 12:42:53,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2023-12-02 12:42:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:53,134 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-02 12:42:53,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-02 12:42:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 12:42:53,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:53,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:42:53,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:42:53,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:42:53,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -131545487, now seen corresponding path program 1 times [2023-12-02 12:42:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281950514] [2023-12-02 12:42:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:42:53,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281950514] [2023-12-02 12:42:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281950514] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:42:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415690303] [2023-12-02 12:42:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:53,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:42:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:42:53,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:42:53,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:42:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:53,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:42:53,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:42:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:42:53,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:42:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:42:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415690303] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:42:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774436267] [2023-12-02 12:42:53,588 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 12:42:53,588 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:42:53,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:42:53,597 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:42:53,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:42:54,789 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:42:59,386 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '145#(and (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base|) 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_node_create_#res#1.offset| 0) (= |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|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16| Int) (|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16| Int) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| Int)) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 |ULTIMATE.start_node_create_#res#1.base|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (= (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_48|) (or (and (= (store |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_53| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select (select |v_#memory_int_49| (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8)))) |v_#memory_int_49|) (= |v_#memory_$Pointer$.base_46| (store (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) |ULTIMATE.start_node_create_#res#1.base|))) (or (not (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= (store (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) 0)) |v_#memory_$Pointer$.offset_46|)) (and (= (select (select (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.base_46|) (= |v_#memory_int_49| |v_#memory_int_53|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16|) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16|) (= (store |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.offset_46|))) (= |v_#memory_int_53| (store |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 0 1) 4 (select (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_#memory_int_52| (store |v_#memory_int_97| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_97| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |v_#memory_$Pointer$.offset_48| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_48| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_51| (store |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_node_create_#res#1.base|) 8)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#length_26| (Array Int Int))) (= |#length| (store |v_#length_26| |ULTIMATE.start_node_create_#res#1.base| 12))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (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-12-02 12:42:59,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:42:59,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:42:59,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-02 12:42:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763796441] [2023-12-02 12:42:59,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:42:59,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:42:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:42:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:42:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:42:59,389 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:59,531 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-12-02 12:42:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:42:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 12:42:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:59,532 INFO L225 Difference]: With dead ends: 22 [2023-12-02 12:42:59,533 INFO L226 Difference]: Without dead ends: 15 [2023-12-02 12:42:59,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:42:59,535 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:59,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:42:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-02 12:42:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-02 12:42:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-02 12:42:59,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2023-12-02 12:42:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:59,539 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-02 12:42:59,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:42:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-02 12:42:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 12:42:59,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:59,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:42:59,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:42:59,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:42:59,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:42:59,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash -559981202, now seen corresponding path program 2 times [2023-12-02 12:42:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873266738] [2023-12-02 12:42:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:43:00,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:43:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873266738] [2023-12-02 12:43:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873266738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:43:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:43:00,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:43:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243721524] [2023-12-02 12:43:00,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:43:00,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:43:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:43:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:43:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:43:00,743 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:01,061 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-12-02 12:43:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:43:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 12:43:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:01,062 INFO L225 Difference]: With dead ends: 22 [2023-12-02 12:43:01,063 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 12:43:01,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:43:01,064 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:01,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:43:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 12:43:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-12-02 12:43:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-12-02 12:43:01,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2023-12-02 12:43:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:01,071 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-12-02 12:43:01,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-12-02 12:43:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 12:43:01,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:01,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:01,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:43:01,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:01,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash -559933865, now seen corresponding path program 1 times [2023-12-02 12:43:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:43:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641827365] [2023-12-02 12:43:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:43:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:43:01,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:43:01,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641827365] [2023-12-02 12:43:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641827365] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:43:01,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:43:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:43:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308157754] [2023-12-02 12:43:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:43:01,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:43:01,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:43:01,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:43:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:43:01,271 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:43:01,364 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-12-02 12:43:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:43:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 12:43:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:43:01,366 INFO L225 Difference]: With dead ends: 20 [2023-12-02 12:43:01,366 INFO L226 Difference]: Without dead ends: 17 [2023-12-02 12:43:01,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:43:01,367 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:43:01,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:43:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-02 12:43:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-02 12:43:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-02 12:43:01,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2023-12-02 12:43:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:43:01,371 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-02 12:43:01,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:43:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-02 12:43:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 12:43:01,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:43:01,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:43:01,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:43:01,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:43:01,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:43:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1270988247, now seen corresponding path program 1 times [2023-12-02 12:43:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:43:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496652028] [2023-12-02 12:43:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:43:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:02,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:43:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496652028] [2023-12-02 12:43:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496652028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:43:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140265967] [2023-12-02 12:43:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:43:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:43:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:43:02,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:43:02,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fbe8657-485e-4bf2-956d-06bba2ceddc9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:43:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:43:03,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 99 conjunts are in the unsatisfiable core [2023-12-02 12:43:03,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:43:03,196 INFO L378 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-12-02 12:43:03,262 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 12:43:03,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 12:43:03,433 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 12:43:03,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 12:43:03,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 12:43:03,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 12:43:03,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-12-02 12:43:03,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-12-02 12:43:03,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:03,737 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2023-12-02 12:43:03,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2023-12-02 12:43:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:03,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:03,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 315 [2023-12-02 12:43:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:03,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:03,985 INFO L349 Elim1Store]: treesize reduction 46, result has 23.3 percent of original size [2023-12-02 12:43:03,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 190 [2023-12-02 12:43:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-12-02 12:43:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,031 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2023-12-02 12:43:04,031 INFO L378 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 3 case distinctions, treesize of input 135 treesize of output 101 [2023-12-02 12:43:04,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,044 INFO L378 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 105 treesize of output 89 [2023-12-02 12:43:04,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2023-12-02 12:43:04,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-12-02 12:43:04,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2023-12-02 12:43:04,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-12-02 12:43:04,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 12:43:04,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:04,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 48 [2023-12-02 12:43:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:43:04,239 INFO L378 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-12-02 12:43:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:43:04,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:43:06,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse69 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (.cse68 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse13 (store .cse69 .cse68 0)) (.cse14 (store (store .cse69 .cse12 0) .cse68 0)) (.cse15 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse12 0) .cse68 0))) (and (forall ((v_ArrVal_499 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_20) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_20)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse0 0) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse10 (store .cse11 .cse2 v_DerPreprocessor_9))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse7 (let ((.cse8 (store .cse9 .cse2 v_DerPreprocessor_8))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse7 .cse5) .cse6))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_19))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 8 .cse0) v_DerPreprocessor_4))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_prenex_21) .cse3) (select (select .cse4 .cse5) .cse6))) (= .cse3 0)))))))))))) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499)))) (forall ((v_ArrVal_499 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_6) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse16 (select .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse21 (store .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse18 (store .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ 4 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse17 (select (select .cse21 .cse19) .cse20))) (or (not (= (select .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= 0 .cse17) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_510) (select (select .cse18 .cse19) .cse20)) .cse17))))))))) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499)) (not (= (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)))))) (forall ((v_ArrVal_499 (Array Int Int))) (or (forall ((v_prenex_20 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_20) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_prenex_20)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse25 (select (select .cse36 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse25 0) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_4 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse27 (select (select .cse34 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse32 (let ((.cse35 (store .cse36 .cse27 v_DerPreprocessor_9))) (store .cse35 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse35 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse28 (let ((.cse33 (store .cse34 .cse27 v_DerPreprocessor_8))) (store .cse33 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse33 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (+ (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse31 (select (select .cse32 .cse29) .cse30))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_19))) (store .cse26 .cse27 (store (select .cse26 .cse27) (+ 8 .cse25) v_DerPreprocessor_4))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_prenex_21) (select (select .cse28 .cse29) .cse30)) .cse31)) (= .cse31 0)))))))))))) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499)))) (forall ((v_ArrVal_499 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_6) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_DerPreprocessor_6)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse37 (select .cse45 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse39 (store .cse45 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse37 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse42 (store .cse43 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse44 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse40 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (+ 4 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse38 (select (select .cse42 .cse40) .cse41))) (or (not (= (select .cse37 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= .cse38 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_510) .cse38) (select (select .cse39 .cse40) .cse41)))))))))) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499)) (not (= (select .cse44 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)))))) (forall ((v_ArrVal_499 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse46 (select (select .cse55 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse46 0) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499)) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_509 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_501 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_501) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_501)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse53 (let ((.cse56 (store .cse49 .cse46 v_DerPreprocessor_10))) (store .cse56 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse56 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse50 (let ((.cse54 (store .cse55 .cse46 v_DerPreprocessor_8))) (store .cse54 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse54 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse51 (select (select .cse50 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (+ (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse47 (select (select .cse53 .cse51) .cse52))) (or (= .cse47 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_509))) (store .cse48 .cse46 (store (select .cse48 .cse46) (+ 8 (select (select .cse49 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_510) (select (select .cse50 .cse51) .cse52)) .cse47)))))))))))) (forall ((v_ArrVal_499 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse12 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse57 (select (select .cse66 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse57 0) (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_509 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_501 Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_501) .cse12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_501)) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse61 (let ((.cse67 (store .cse60 .cse57 v_DerPreprocessor_10))) (store .cse67 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse67 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse64 (let ((.cse65 (store .cse66 .cse57 v_DerPreprocessor_8))) (store .cse65 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse65 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse62 (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (+ (select (select .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse58 (select (select .cse64 .cse62) .cse63))) (or (= .cse58 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_509))) (store .cse59 .cse57 (store (select .cse59 .cse57) (+ 8 (select (select .cse60 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) v_DerPreprocessor_3))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_510) .cse58) (select (select .cse61 .cse62) .cse63))))))))) (not (= (store .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.offset| (select v_ArrVal_499 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) v_ArrVal_499))))))))) is different from false [2023-12-02 12:43:39,641 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 177 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:43:39,805 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-12-02 12:43:39,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 98 [2023-12-02 12:43:39,862 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-12-02 12:43:39,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 105 [2023-12-02 12:43:39,939 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-12-02 12:43:39,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 80 [2023-12-02 12:43:40,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:43:40,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 12:43:40,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:43:40,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 8