./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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.5-dev-84cfde4 [2024-10-11 17:23:42,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:23:42,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:23:42,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:23:42,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:23:42,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:23:42,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:23:42,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:23:42,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:23:42,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:23:42,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:23:42,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:23:42,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:23:42,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:23:42,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:23:42,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:23:42,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:23:42,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:23:42,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:23:42,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:23:42,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:23:42,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:23:42,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:23:42,873 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:23:42,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:23:42,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:23:42,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:23:42,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:23:42,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:23:42,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:23:42,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:23:42,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:23:42,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:23:42,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:23:42,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:23:42,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:23:42,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:42,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:23:42,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:23:42,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:23:42,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:23:42,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:23:42,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:23:42,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:23:42,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:23:42,878 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 [2024-10-11 17:23:43,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:23:43,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:23:43,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:23:43,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:23:43,194 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:23:43,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-10-11 17:23:44,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:23:44,615 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 17:23:44,819 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:23:44,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-10-11 17:23:44,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a225f5587/26aaf3b198ee4ad1ac33b23baf9ab531/FLAG84e01aa91 [2024-10-11 17:23:44,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a225f5587/26aaf3b198ee4ad1ac33b23baf9ab531 [2024-10-11 17:23:44,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:23:44,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:23:44,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:44,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:23:44,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:23:44,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:44" (1/1) ... [2024-10-11 17:23:44,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9c82ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:44, skipping insertion in model container [2024-10-11 17:23:44,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:23:44" (1/1) ... [2024-10-11 17:23:44,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:23:45,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:45,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:23:45,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:23:45,348 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:23:45,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45 WrapperNode [2024-10-11 17:23:45,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:23:45,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:45,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:23:45,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:23:45,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,422 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-11 17:23:45,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:23:45,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:23:45,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:23:45,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:23:45,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,488 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 18, 6, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2024-10-11 17:23:45,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:23:45,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:23:45,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:23:45,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:23:45,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (1/1) ... [2024-10-11 17:23:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:23:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:45,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:23:45,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:23:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-11 17:23:45,606 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:23:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:23:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:23:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 17:23:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 17:23:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-10-11 17:23:45,608 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-10-11 17:23:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:23:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:23:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:23:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:23:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 17:23:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 17:23:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-10-11 17:23:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-10-11 17:23:45,611 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-10-11 17:23:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:23:45,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:23:45,748 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:23:45,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:23:46,074 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-10-11 17:23:46,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:23:46,119 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:23:46,120 INFO L314 CfgBuilder]: Removed 33 assume(true) statements. [2024-10-11 17:23:46,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:46 BoogieIcfgContainer [2024-10-11 17:23:46,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:23:46,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:23:46,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:23:46,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:23:46,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:23:44" (1/3) ... [2024-10-11 17:23:46,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f0f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:46, skipping insertion in model container [2024-10-11 17:23:46,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:23:45" (2/3) ... [2024-10-11 17:23:46,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f0f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:23:46, skipping insertion in model container [2024-10-11 17:23:46,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:46" (3/3) ... [2024-10-11 17:23:46,129 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2024-10-11 17:23:46,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:23:46,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:23:46,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:23:46,191 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@69f5bf49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:23:46,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:23:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 81 states have internal predecessors, (124), 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) [2024-10-11 17:23:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:23:46,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:46,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:23:46,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 438214350, now seen corresponding path program 1 times [2024-10-11 17:23:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377079839] [2024-10-11 17:23:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:23:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377079839] [2024-10-11 17:23:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377079839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:23:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:23:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:23:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204742253] [2024-10-11 17:23:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:23:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:23:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:23:46,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:23:46,441 INFO L87 Difference]: Start difference. First operand has 94 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 81 states have internal predecessors, (124), 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) [2024-10-11 17:23:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:23:46,486 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-10-11 17:23:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:23:46,489 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 [2024-10-11 17:23:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:23:46,498 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:23:46,499 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 17:23:46,501 INFO L431 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 [2024-10-11 17:23:46,504 INFO L432 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 [2024-10-11 17:23:46,506 INFO L433 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] [2024-10-11 17:23:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 17:23:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 17:23:46,544 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) [2024-10-11 17:23:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2024-10-11 17:23:46,547 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 16 [2024-10-11 17:23:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:23:46,548 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-11 17:23:46,548 INFO L472 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) [2024-10-11 17:23:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2024-10-11 17:23:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:23:46,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:23:46,550 INFO L215 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] [2024-10-11 17:23:46,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:23:46,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:23:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:23:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -33787687, now seen corresponding path program 1 times [2024-10-11 17:23:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:23:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475952834] [2024-10-11 17:23:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:23:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:23:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:23:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:23:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:23:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475952834] [2024-10-11 17:23:47,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475952834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:23:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5821715] [2024-10-11 17:23:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:23:47,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:23:47,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:23:47,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:23:47,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:23:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:23:47,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 17:23:47,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:23:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:23:47,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:23:47,801 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 20 treesize of output 12 [2024-10-11 17:23:47,859 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 20 treesize of output 12 [2024-10-11 17:23:47,895 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 16 treesize of output 8 [2024-10-11 17:23:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:23:47,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:23:47,984 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 34 treesize of output 30 [2024-10-11 17:23:48,109 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 30 treesize of output 26 [2024-10-11 17:23:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:23:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5821715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:23:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:23:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 13 [2024-10-11 17:23:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727681696] [2024-10-11 17:23:48,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:23:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:23:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:23:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:23:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:23:48,143 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 13 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:23:52,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:23:56,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:00,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:04,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:08,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:12,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:24:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:13,095 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2024-10-11 17:24:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 17:24:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-11 17:24:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:13,098 INFO L225 Difference]: With dead ends: 117 [2024-10-11 17:24:13,098 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 17:24:13,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:24:13,100 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 155 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 39 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:13,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 472 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 731 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-10-11 17:24:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 17:24:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2024-10-11 17:24:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 92 states have internal predecessors, (103), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 17:24:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2024-10-11 17:24:13,112 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 29 [2024-10-11 17:24:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:13,112 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2024-10-11 17:24:13,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 17:24:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2024-10-11 17:24:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 17:24:13,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:13,114 INFO L215 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, 1, 1] [2024-10-11 17:24:13,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:24:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:13,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -273449149, now seen corresponding path program 1 times [2024-10-11 17:24:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:13,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229630980] [2024-10-11 17:24:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:24:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 17:24:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:24:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:24:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229630980] [2024-10-11 17:24:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229630980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:24:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817879227] [2024-10-11 17:24:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:13,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:13,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:24:13,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:24:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:24:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:24:13,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 17:24:13,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:24:13,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:24:13,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:24:14,067 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 27 treesize of output 19 [2024-10-11 17:24:14,070 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 27 treesize of output 19 [2024-10-11 17:24:14,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:24:14,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:24:14,237 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 19 treesize of output 11 [2024-10-11 17:24:14,243 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 19 treesize of output 11 [2024-10-11 17:24:14,247 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 15 treesize of output 7 [2024-10-11 17:24:14,251 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 15 treesize of output 7 [2024-10-11 17:24:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:24:14,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:24:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817879227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:24:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:24:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-10-11 17:24:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316869643] [2024-10-11 17:24:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:24:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:24:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:24:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:24:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:24:14,373 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:24:14,824 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2024-10-11 17:24:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:24:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-11 17:24:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:24:14,826 INFO L225 Difference]: With dead ends: 206 [2024-10-11 17:24:14,826 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 17:24:14,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:24:14,827 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 166 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:24:14,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 715 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:24:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 17:24:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 133. [2024-10-11 17:24:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 114 states have internal predecessors, (129), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 17:24:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2024-10-11 17:24:14,853 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 31 [2024-10-11 17:24:14,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:24:14,853 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2024-10-11 17:24:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:24:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2024-10-11 17:24:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 17:24:14,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:24:14,854 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-10-11 17:24:14,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:24:15,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:24:15,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:24:15,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:24:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 320934575, now seen corresponding path program 1 times [2024-10-11 17:24:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:24:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139472029] [2024-10-11 17:24:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:24:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:24:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:24:15,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:24:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:24:15,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:24:15,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:24:15,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-10-11 17:24:15,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-10-11 17:24:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:24:15,153 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 17:24:15,180 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:24:15,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:24:15 BoogieIcfgContainer [2024-10-11 17:24:15,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:24:15,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:24:15,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:24:15,185 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:24:15,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:23:46" (3/4) ... [2024-10-11 17:24:15,186 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 17:24:15,241 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:24:15,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:24:15,241 INFO L158 Benchmark]: Toolchain (without parser) took 30394.43ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 109.4MB in the beginning and 90.3MB in the end (delta: 19.1MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,242 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 65.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:24:15,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.49ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 88.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.08ms. Allocated memory is still 161.5MB. Free memory was 88.9MB in the beginning and 131.4MB in the end (delta: -42.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,242 INFO L158 Benchmark]: Boogie Preprocessor took 111.12ms. Allocated memory is still 161.5MB. Free memory was 131.4MB in the beginning and 126.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,243 INFO L158 Benchmark]: RCFGBuilder took 586.59ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 96.1MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,243 INFO L158 Benchmark]: TraceAbstraction took 29061.71ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 96.1MB in the beginning and 93.4MB in the end (delta: 2.7MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,243 INFO L158 Benchmark]: Witness Printer took 56.24ms. Allocated memory is still 195.0MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:24:15,244 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 65.5MB in the beginning and 65.4MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.49ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 88.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.08ms. Allocated memory is still 161.5MB. Free memory was 88.9MB in the beginning and 131.4MB in the end (delta: -42.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.12ms. Allocated memory is still 161.5MB. Free memory was 131.4MB in the beginning and 126.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 586.59ms. Allocated memory is still 161.5MB. Free memory was 126.4MB in the beginning and 96.1MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29061.71ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 96.1MB in the beginning and 93.4MB in the end (delta: 2.7MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 56.24ms. Allocated memory is still 195.0MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); [L588] struct node *list = ((void *)0); [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L590] RET chain_node(&list) VAL [list={5:0}, pp1={3:0}, pp2={6:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-2:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L597] RET chain_node(&list) VAL [list={5:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) [L642] CALL check_seq_next(p1, p2) VAL [\old(beg)={-1:0}, \old(end)={-1:0}] [L626] COND FALSE !(!(beg)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] CALL fail() [L565] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_to_dll_rev-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 637]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 1296 SdHoareTripleChecker+Invalid, 24.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1046 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 981 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 250 mSDtfsCounter, 981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 83 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 159 ConstructedInterpolants, 8 QuantifiedInterpolants, 1346 SizeOfPredicates, 29 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 8/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 17:24:15,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)