./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:35:08,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:35:08,110 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2023-11-23 21:35:08,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:35:08,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:35:08,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:35:08,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:35:08,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:35:08,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:35:08,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:35:08,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:35:08,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:35:08,146 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:35:08,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:35:08,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:35:08,148 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:35:08,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:35:08,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:35:08,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:35:08,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:35:08,151 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:35:08,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:35:08,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:35:08,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:35:08,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:35:08,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:35:08,155 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:35:08,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:35:08,156 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:35:08,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:35:08,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:35:08,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:35:08,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:35:08,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:35:08,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:35:08,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:35:08,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:35:08,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:35:08,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:35:08,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:35:08,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:35:08,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:35:08,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/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_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ 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 valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2023-11-23 21:35:08,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:35:08,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:35:08,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:35:08,442 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:35:08,445 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:35:08,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2023-11-23 21:35:11,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:35:12,041 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:35:12,041 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2023-11-23 21:35:12,058 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/data/edcf5c3fc/fb9938ac09ee409799cf70044eea871a/FLAG36991a9dd [2023-11-23 21:35:12,074 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/data/edcf5c3fc/fb9938ac09ee409799cf70044eea871a [2023-11-23 21:35:12,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:35:12,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:35:12,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:35:12,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:35:12,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:35:12,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c62d637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12, skipping insertion in model container [2023-11-23 21:35:12,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:35:12,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:35:12,504 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:35:12,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:35:12,591 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:35:12,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12 WrapperNode [2023-11-23 21:35:12,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:35:12,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:35:12,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:35:12,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:35:12,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,653 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2023-11-23 21:35:12,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:35:12,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:35:12,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:35:12,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:35:12,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:35:12,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:35:12,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:35:12,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:35:12,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (1/1) ... [2023-11-23 21:35:12,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:35:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:35:12,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:35:12,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:35:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-23 21:35:12,791 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-23 21:35:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:35:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:35:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:35:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:35:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:35:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2023-11-23 21:35:12,795 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2023-11-23 21:35:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:35:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 21:35:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2023-11-23 21:35:12,797 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2023-11-23 21:35:12,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:35:12,798 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2023-11-23 21:35:12,798 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2023-11-23 21:35:12,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:35:12,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:35:12,936 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:35:12,939 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:35:13,308 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:35:13,378 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:35:13,378 INFO L309 CfgBuilder]: Removed 33 assume(true) statements. [2023-11-23 21:35:13,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:35:13 BoogieIcfgContainer [2023-11-23 21:35:13,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:35:13,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:35:13,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:35:13,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:35:13,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:35:12" (1/3) ... [2023-11-23 21:35:13,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689c02f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:35:13, skipping insertion in model container [2023-11-23 21:35:13,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:35:12" (2/3) ... [2023-11-23 21:35:13,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689c02f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:35:13, skipping insertion in model container [2023-11-23 21:35:13,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:35:13" (3/3) ... [2023-11-23 21:35:13,390 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2023-11-23 21:35:13,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:35:13,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 21:35:13,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:35:13,472 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48419bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:35:13,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-23 21:35:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 73 states have (on average 1.726027397260274) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-23 21:35:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 21:35:13,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:35:13,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:35:13,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-23 21:35:13,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:35:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1196038775, now seen corresponding path program 1 times [2023-11-23 21:35:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:35:13,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428746179] [2023-11-23 21:35:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:35:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:35:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:35:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:35:13,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:35:13,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428746179] [2023-11-23 21:35:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428746179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:35:13,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:35:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:35:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844942411] [2023-11-23 21:35:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:35:13,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:35:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:35:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:35:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:35:13,857 INFO L87 Difference]: Start difference. First operand has 95 states, 73 states have (on average 1.726027397260274) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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-11-23 21:35:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:35:13,908 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2023-11-23 21:35:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:35:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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) Word has length 16 [2023-11-23 21:35:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:35:13,922 INFO L225 Difference]: With dead ends: 92 [2023-11-23 21:35:13,922 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 21:35:13,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:35:13,932 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:35:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:35:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 21:35:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 21:35:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 78 states have internal predecessors, (86), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 21:35:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-11-23 21:35:13,987 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 16 [2023-11-23 21:35:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:35:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-11-23 21:35:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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-11-23 21:35:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-11-23 21:35:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 21:35:13,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:35:13,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:35:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:35:13,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2023-11-23 21:35:13,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:35:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -41595090, now seen corresponding path program 1 times [2023-11-23 21:35:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:35:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391230573] [2023-11-23 21:35:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:35:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:35:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:35:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 21:35:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:35:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 21:35:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:35:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:35:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:35:16,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391230573] [2023-11-23 21:35:16,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391230573] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:35:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827078930] [2023-11-23 21:35:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:35:16,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:35:16,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:35:16,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:35:16,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6310e96f-f429-4b86-aa9f-c2a899edd77d/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:35:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:35:16,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-23 21:35:16,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:35:16,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-23 21:35:16,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 21:35:16,879 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-23 21:35:16,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 21 [2023-11-23 21:35:17,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:17,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:17,082 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 24 treesize of output 14 [2023-11-23 21:35:17,099 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 18 treesize of output 3 [2023-11-23 21:35:17,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-23 21:35:17,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-11-23 21:35:17,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 21:35:18,253 INFO L349 Elim1Store]: treesize reduction 158, result has 17.7 percent of original size [2023-11-23 21:35:18,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 110 treesize of output 185 [2023-11-23 21:35:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-23 21:35:18,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:18,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:18,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:18,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:35:18,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 21:35:18,534 INFO L349 Elim1Store]: treesize reduction 156, result has 3.1 percent of original size [2023-11-23 21:35:18,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 57 [2023-11-23 21:35:20,120 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse0 (+ 2 .cse31))) (let ((.cse4 (<= .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|)) (.cse5 (not (= .cse31 0)))) (or (and (exists ((v_prenex_2 Int) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (v_DerPreprocessor_16 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_16) |chain_node_~node~0#1.base| v_DerPreprocessor_17) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_18) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 v_prenex_2)) (.cse3 (select .cse1 |v_chain_node_alloc_node_~ptr~0#1.base_16|))) (and (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select .cse1 |chain_node_~node~0#1.base|) v_DerPreprocessor_17) (= v_DerPreprocessor_16 (select .cse1 v_prenex_2)) (not (= |chain_node_~node~0#1.base| v_prenex_2)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= |chain_node_~node~0#1.base| v_prenex_2) (= .cse3 v_DerPreprocessor_18) (<= .cse2 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= .cse3 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse4 .cse5) (and (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|chain_node_~node~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_1) v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse10))) (let ((.cse8 (+ |v_chain_node_alloc_node_~ptr~0#1.base_16| 2)) (.cse6 (select .cse9 v_prenex_2)) (.cse7 (select .cse9 |chain_node_~node~0#1.base|))) (and (= v_DerPreprocessor_2 .cse6) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) .cse7) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_1 (select .cse9 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse6) (= v_DerPreprocessor_3 .cse7) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_8) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse10) |v_chain_node_alloc_node_~ptr~0#1.base_16|) (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|))))))) .cse4) (and .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_2 Int) (v_DerPreprocessor_6 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse16)) (.cse15 (store (store (store |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base| v_DerPreprocessor_5) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_6) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse16))) (let ((.cse12 (+ 2 |chain_node_~node~0#1.base|)) (.cse13 (select .cse15 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (.cse11 (select .cse14 v_prenex_2))) (and (= v_DerPreprocessor_2 .cse11) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_6 .cse13) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) (select .cse14 |chain_node_~node~0#1.base|)) (= (select .cse15 |chain_node_~node~0#1.base|) v_DerPreprocessor_5) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= .cse13 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse11))))))) (and .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_13) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_14) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse23)) (.cse22 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse23))) (let ((.cse20 (select .cse22 |chain_node_~node~0#1.base|)) (.cse21 (+ 2 v_prenex_2)) (.cse17 (select .cse19 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (.cse18 (select .cse22 v_prenex_2))) (and (= .cse17 v_DerPreprocessor_14) (= v_DerPreprocessor_2 .cse18) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_13 (select .cse19 v_prenex_2)) (= v_DerPreprocessor_3 .cse20) (<= .cse21 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) .cse20) (<= .cse21 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= .cse17 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse18))))))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse30 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| v_prenex_1 v_DerPreprocessor_10) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_11) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse30))) (let ((.cse29 (store (store (store (store |c_#memory_$Pointer$.base| v_prenex_1 (select .cse28 v_prenex_1)) v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse30))) (let ((.cse25 (select .cse29 |chain_node_~node~0#1.base|)) (.cse24 (+ 2 v_prenex_1)) (.cse27 (select .cse29 v_prenex_2)) (.cse26 (select .cse28 |v_chain_node_alloc_node_~ptr~0#1.base_16|))) (and (not (= |chain_node_~node~0#1.base| v_prenex_1)) (<= .cse24 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse25 (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|)) (not (= |v_chain_node_alloc_node_~ptr~0#1.base_16| v_prenex_1)) (= .cse25 v_DerPreprocessor_3) (= .cse26 v_DerPreprocessor_11) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse24 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= v_DerPreprocessor_2 .cse27) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse27) (not (= v_prenex_2 v_prenex_1)) (= .cse26 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)))))))) .cse4)) .cse5))))) is different from true [2023-11-23 21:35:25,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:35:25,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 2297 treesize of output 3391 [2023-11-23 21:36:00,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-23 21:36:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:36:00,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:36:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827078930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:36:00,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 21:36:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-11-23 21:36:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288655060] [2023-11-23 21:36:00,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 21:36:00,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 21:36:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:36:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 21:36:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=524, Unknown=6, NotChecked=46, Total=650 [2023-11-23 21:36:00,751 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 25 states, 16 states have (on average 2.5625) internal successors, (41), 21 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 21:36:02,466 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse5 (not (= .cse31 0)))) (and (let ((.cse0 (+ 2 .cse31))) (let ((.cse4 (<= .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|))) (or (and (exists ((v_prenex_2 Int) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (v_DerPreprocessor_16 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_16) |chain_node_~node~0#1.base| v_DerPreprocessor_17) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_18) |ULTIMATE.start_create_sll_~#list~0#1.base| (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|)))) (let ((.cse2 (+ 2 v_prenex_2)) (.cse3 (select .cse1 |v_chain_node_alloc_node_~ptr~0#1.base_16|))) (and (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select .cse1 |chain_node_~node~0#1.base|) v_DerPreprocessor_17) (= v_DerPreprocessor_16 (select .cse1 v_prenex_2)) (not (= |chain_node_~node~0#1.base| v_prenex_2)) (<= .cse2 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= |chain_node_~node~0#1.base| v_prenex_2) (= .cse3 v_DerPreprocessor_18) (<= .cse2 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= .cse3 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)))))) .cse4 .cse5) (and (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|chain_node_~node~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_1) v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse10))) (let ((.cse8 (+ |v_chain_node_alloc_node_~ptr~0#1.base_16| 2)) (.cse6 (select .cse9 v_prenex_2)) (.cse7 (select .cse9 |chain_node_~node~0#1.base|))) (and (= v_DerPreprocessor_2 .cse6) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) .cse7) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse8 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_1 (select .cse9 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (<= .cse8 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse6) (= v_DerPreprocessor_3 .cse7) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_8) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse10) |v_chain_node_alloc_node_~ptr~0#1.base_16|) (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|))))))) .cse4) (and .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_2 Int) (v_DerPreprocessor_6 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (let ((.cse16 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse16)) (.cse15 (store (store (store |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base| v_DerPreprocessor_5) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_6) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse16))) (let ((.cse12 (+ 2 |chain_node_~node~0#1.base|)) (.cse13 (select .cse15 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (.cse11 (select .cse14 v_prenex_2))) (and (= v_DerPreprocessor_2 .cse11) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse12 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_6 .cse13) (<= .cse12 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) (select .cse14 |chain_node_~node~0#1.base|)) (= (select .cse15 |chain_node_~node~0#1.base|) v_DerPreprocessor_5) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= .cse13 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse11))))))) (and .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (|chain_node_~node~0#1.base| Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse23 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_13) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_14) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse23)) (.cse22 (store (store (store |c_#memory_$Pointer$.base| v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse23))) (let ((.cse20 (select .cse22 |chain_node_~node~0#1.base|)) (.cse21 (+ 2 v_prenex_2)) (.cse17 (select .cse19 |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (.cse18 (select .cse22 v_prenex_2))) (and (= .cse17 v_DerPreprocessor_14) (= v_DerPreprocessor_2 .cse18) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= v_DerPreprocessor_13 (select .cse19 v_prenex_2)) (= v_DerPreprocessor_3 .cse20) (<= .cse21 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|) .cse20) (<= .cse21 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= .cse17 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse18))))))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 Int) (|v_chain_node_alloc_node_~ptr~0#1.base_16| Int) (|chain_node_~node~0#1.base| Int) (|ULTIMATE.start_create_sll_~#list~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse30 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_create_sll_~#list~0#1.base|))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| v_prenex_1 v_DerPreprocessor_10) |v_chain_node_alloc_node_~ptr~0#1.base_16| v_DerPreprocessor_11) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse30))) (let ((.cse29 (store (store (store (store |c_#memory_$Pointer$.base| v_prenex_1 (select .cse28 v_prenex_1)) v_prenex_2 v_DerPreprocessor_2) |chain_node_~node~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_create_sll_~#list~0#1.base| .cse30))) (let ((.cse25 (select .cse29 |chain_node_~node~0#1.base|)) (.cse24 (+ 2 v_prenex_1)) (.cse27 (select .cse29 v_prenex_2)) (.cse26 (select .cse28 |v_chain_node_alloc_node_~ptr~0#1.base_16|))) (and (not (= |chain_node_~node~0#1.base| v_prenex_1)) (<= .cse24 |ULTIMATE.start_create_sll_~#list~0#1.base|) (= .cse25 (select |c_#memory_$Pointer$.base| |chain_node_~node~0#1.base|)) (not (= |v_chain_node_alloc_node_~ptr~0#1.base_16| v_prenex_1)) (= .cse25 v_DerPreprocessor_3) (= .cse26 v_DerPreprocessor_11) (<= .cse0 |ULTIMATE.start_create_sll_~#list~0#1.base|) (<= .cse24 |c_ULTIMATE.start_main_~#p1~0#1.base|) (= v_DerPreprocessor_2 .cse27) (= (select |c_#memory_$Pointer$.base| v_prenex_2) .cse27) (not (= v_prenex_2 v_prenex_1)) (= .cse26 (select |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_16|)) (not (= |ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_main_~#p1~0#1.base|)))))))) .cse4)) .cse5)))) .cse5))) is different from true