./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:05:03,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:05:03,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:05:03,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:05:03,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:05:03,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:05:03,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:05:03,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:05:03,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:05:03,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:05:03,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:05:03,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:05:03,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:05:03,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:05:03,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:05:03,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:05:03,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:05:03,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:05:03,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:05:03,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:05:03,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:05:03,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:05:03,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:05:03,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:05:03,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:05:03,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:05:03,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:05:03,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:05:03,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:05:03,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:05:03,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:05:03,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:05:03,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:05:03,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:05:03,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:05:03,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:05:03,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:05:03,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:05:03,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:05:03,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:05:03,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:05:03,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:05:03,558 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/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/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 ! call(reach_error())) ) 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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2024-11-09 22:05:03,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:05:03,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:05:03,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:05:03,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:05:03,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:05:03,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2024-11-09 22:05:05,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:05:05,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:05:05,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2024-11-09 22:05:05,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477cba288/445f04230bc6441cb8e46e5117b16e21/FLAG1febaf69c [2024-11-09 22:05:05,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/477cba288/445f04230bc6441cb8e46e5117b16e21 [2024-11-09 22:05:05,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:05:05,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:05:05,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:05:05,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:05:05,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:05:05,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:05" (1/1) ... [2024-11-09 22:05:05,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e83aeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:05, skipping insertion in model container [2024-11-09 22:05:05,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:05" (1/1) ... [2024-11-09 22:05:05,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:05:06,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2024-11-09 22:05:06,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2024-11-09 22:05:06,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2024-11-09 22:05:06,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2024-11-09 22:05:06,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2024-11-09 22:05:06,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2024-11-09 22:05:06,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:05:06,188 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:05:06,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2024-11-09 22:05:06,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2024-11-09 22:05:06,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2024-11-09 22:05:06,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2024-11-09 22:05:06,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2024-11-09 22:05:06,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2024-11-09 22:05:06,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:05:06,293 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:05:06,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06 WrapperNode [2024-11-09 22:05:06,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:05:06,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:05:06,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:05:06,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:05:06,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,359 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2024-11-09 22:05:06,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:05:06,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:05:06,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:05:06,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:05:06,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,403 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-09 22:05:06,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:05:06,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:05:06,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:05:06,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:05:06,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (1/1) ... [2024-11-09 22:05:06,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:05:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:05:06,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:05:06,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:05:06,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:05:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:05:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:05:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:05:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:05:06,616 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:05:06,618 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:05:06,768 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 22:05:06,769 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:05:06,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:05:06,782 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:05:06,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:06 BoogieIcfgContainer [2024-11-09 22:05:06,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:05:06,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:05:06,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:05:06,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:05:06,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:05:05" (1/3) ... [2024-11-09 22:05:06,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a83ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:06, skipping insertion in model container [2024-11-09 22:05:06,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:06" (2/3) ... [2024-11-09 22:05:06,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a83ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:06, skipping insertion in model container [2024-11-09 22:05:06,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:06" (3/3) ... [2024-11-09 22:05:06,794 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2024-11-09 22:05:06,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:05:06,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-09 22:05:06,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:05:06,857 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f9049da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:05:06,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 22:05:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 22:05:06,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:06,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:06,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-09 22:05:06,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash 229635109, now seen corresponding path program 1 times [2024-11-09 22:05:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:06,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23118051] [2024-11-09 22:05:06,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:07,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23118051] [2024-11-09 22:05:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23118051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:05:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862100411] [2024-11-09 22:05:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:05:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:05:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:05:07,180 INFO L87 Difference]: Start difference. First operand has 52 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 51 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:07,252 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2024-11-09 22:05:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:05:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 22:05:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:07,261 INFO L225 Difference]: With dead ends: 94 [2024-11-09 22:05:07,262 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 22:05:07,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:05:07,267 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:07,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:05:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 22:05:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 22:05:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-09 22:05:07,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 7 [2024-11-09 22:05:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:07,296 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-09 22:05:07,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-09 22:05:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 22:05:07,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:07,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:07,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:05:07,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-09 22:05:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1473339494, now seen corresponding path program 1 times [2024-11-09 22:05:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:07,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810087437] [2024-11-09 22:05:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:05:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:05:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:05:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810087437] [2024-11-09 22:05:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810087437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:05:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:05:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:05:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599434755] [2024-11-09 22:05:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:05:07,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:05:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:05:07,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:05:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:05:07,470 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:05:07,543 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2024-11-09 22:05:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:05:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 22:05:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:05:07,545 INFO L225 Difference]: With dead ends: 59 [2024-11-09 22:05:07,545 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 22:05:07,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:05:07,547 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:05:07,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:05:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 22:05:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2024-11-09 22:05:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-09 22:05:07,561 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 8 [2024-11-09 22:05:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:05:07,561 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-09 22:05:07,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:05:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-09 22:05:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 22:05:07,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:05:07,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:05:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:05:07,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-09 22:05:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:05:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -825172528, now seen corresponding path program 1 times [2024-11-09 22:05:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:05:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109891797] [2024-11-09 22:05:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:05:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:05:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:05:07,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:05:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:05:07,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:05:07,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:05:07,670 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-09 22:05:07,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-09 22:05:07,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-09 22:05:07,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-09 22:05:07,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-09 22:05:07,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-09 22:05:07,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:05:07,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 22:05:07,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:05:07,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:05:07 BoogieIcfgContainer [2024-11-09 22:05:07,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:05:07,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:05:07,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:05:07,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:05:07,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:05:06" (3/4) ... [2024-11-09 22:05:07,710 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:05:07,748 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:05:07,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:05:07,749 INFO L158 Benchmark]: Toolchain (without parser) took 1949.48ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 73.5MB in the end (delta: 49.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,749 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:05:07,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.17ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 148.7MB in the end (delta: -26.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.64ms. Allocated memory is still 178.3MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,750 INFO L158 Benchmark]: Boogie Preprocessor took 65.56ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 144.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,750 INFO L158 Benchmark]: IcfgBuilder took 357.89ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 129.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,751 INFO L158 Benchmark]: TraceAbstraction took 921.25ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 75.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,751 INFO L158 Benchmark]: Witness Printer took 40.28ms. Allocated memory is still 178.3MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:05:07,753 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.19ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.17ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 148.7MB in the end (delta: -26.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.64ms. Allocated memory is still 178.3MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.56ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 144.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 357.89ms. Allocated memory is still 178.3MB. Free memory was 144.8MB in the beginning and 129.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 921.25ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 75.6MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 40.28ms. Allocated memory is still 178.3MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.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: 1031]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: 1043]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 69 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-11-09 22:05:07,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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