./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:16:51,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:16:51,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:16:51,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:16:51,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:16:51,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:16:51,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:16:51,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:16:51,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:16:51,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:16:51,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:16:51,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:16:51,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:16:51,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:16:51,512 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:16:51,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:16:51,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:16:51,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:16:51,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:16:51,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:16:51,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:16:51,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:16:51,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:16:51,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:16:51,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:16:51,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:16:51,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:16:51,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:16:51,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:16:51,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:16:51,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:16:51,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:16:51,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:51,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:16:51,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:16:51,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:16:51,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:16:51,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:16:51,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:16:51,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:16:51,519 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:16:51,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:16:51,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:16:51,519 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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-01-27 16:16:51,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:16:51,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:16:51,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:16:51,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:16:51,826 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:16:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2024-01-27 16:16:52,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:16:53,186 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:16:53,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2024-01-27 16:16:53,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cc7d551/adc1548539724315807d521b1928f90f/FLAG98afe131a [2024-01-27 16:16:53,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cc7d551/adc1548539724315807d521b1928f90f [2024-01-27 16:16:53,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:16:53,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:16:53,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:53,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:16:53,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:16:53,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a4ac0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53, skipping insertion in model container [2024-01-27 16:16:53,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:16:53,605 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[186287,186300] [2024-01-27 16:16:53,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:53,671 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:16:53,712 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[186287,186300] [2024-01-27 16:16:53,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:53,778 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:16:53,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53 WrapperNode [2024-01-27 16:16:53,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:53,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:53,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:16:53,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:16:53,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,821 INFO L138 Inliner]: procedures = 248, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2024-01-27 16:16:53,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:53,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:16:53,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:16:53,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:16:53,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,851 INFO L175 MemorySlicer]: Split 25 memory accesses to 5 slices as follows [2, 3, 3, 2, 15]. 60 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0]. The 12 writes are split as follows [0, 1, 1, 2, 8]. [2024-01-27 16:16:53,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:16:53,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:16:53,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:16:53,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:16:53,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (1/1) ... [2024-01-27 16:16:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:16:53,900 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-01-27 16:16:53,920 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-01-27 16:16:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-01-27 16:16:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-01-27 16:16:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:16:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:16:53,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:16:53,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:16:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:16:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:16:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:16:53,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:16:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:16:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:16:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:16:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-27 16:16:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-27 16:16:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-27 16:16:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-27 16:16:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-01-27 16:16:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:16:53,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:16:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:16:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:16:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:16:53,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:16:53,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:16:53,992 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:16:54,313 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:16:54,315 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:16:54,650 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:16:54,659 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:16:54,849 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:16:54,849 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:16:54,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:54 BoogieIcfgContainer [2024-01-27 16:16:54,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:16:54,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:16:54,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:16:54,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:16:54,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:16:53" (1/3) ... [2024-01-27 16:16:54,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4096c186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:54, skipping insertion in model container [2024-01-27 16:16:54,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:53" (2/3) ... [2024-01-27 16:16:54,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4096c186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:54, skipping insertion in model container [2024-01-27 16:16:54,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:54" (3/3) ... [2024-01-27 16:16:54,855 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2024-01-27 16:16:54,861 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:16:54,868 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:16:54,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-01-27 16:16:54,868 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:16:54,901 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:16:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 63 transitions, 140 flow [2024-01-27 16:16:54,968 INFO L124 PetriNetUnfolderBase]: 8/76 cut-off events. [2024-01-27 16:16:54,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:16:54,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 76 events. 8/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2024-01-27 16:16:54,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 63 transitions, 140 flow [2024-01-27 16:16:54,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 56 transitions, 124 flow [2024-01-27 16:16:54,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:16:54,984 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@6cf54f7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:16:54,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-01-27 16:16:54,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:16:54,990 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-01-27 16:16:54,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:16:54,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:54,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:54,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:16:54,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -817256833, now seen corresponding path program 1 times [2024-01-27 16:16:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983751268] [2024-01-27 16:16:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983751268] [2024-01-27 16:16:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983751268] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:16:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749528051] [2024-01-27 16:16:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:55,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:55,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:55,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2024-01-27 16:16:55,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-27 16:16:55,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:55,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2024-01-27 16:16:55,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:56,142 INFO L124 PetriNetUnfolderBase]: 1534/2570 cut-off events. [2024-01-27 16:16:56,143 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-01-27 16:16:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5080 conditions, 2570 events. 1534/2570 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13468 event pairs, 1309 based on Foata normal form. 2/2425 useless extension candidates. Maximal degree in co-relation 4963. Up to 2124 conditions per place. [2024-01-27 16:16:56,158 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 52 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2024-01-27 16:16:56,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 258 flow [2024-01-27 16:16:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-01-27 16:16:56,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2024-01-27 16:16:56,170 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 124 flow. Second operand 3 states and 94 transitions. [2024-01-27 16:16:56,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 258 flow [2024-01-27 16:16:56,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:16:56,179 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 118 flow [2024-01-27 16:16:56,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-01-27 16:16:56,183 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2024-01-27 16:16:56,183 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 118 flow [2024-01-27 16:16:56,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-01-27 16:16:56,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:56,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:16:56,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:16:56,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 595246558, now seen corresponding path program 1 times [2024-01-27 16:16:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758823440] [2024-01-27 16:16:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:56,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:56,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758823440] [2024-01-27 16:16:56,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758823440] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:56,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:56,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:56,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281662306] [2024-01-27 16:16:56,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:56,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:56,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2024-01-27 16:16:56,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-27 16:16:56,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:56,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2024-01-27 16:16:56,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:56,715 INFO L124 PetriNetUnfolderBase]: 1782/3058 cut-off events. [2024-01-27 16:16:56,716 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-01-27 16:16:56,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6196 conditions, 3058 events. 1782/3058 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 16894 event pairs, 1209 based on Foata normal form. 120/3033 useless extension candidates. Maximal degree in co-relation 3606. Up to 2068 conditions per place. [2024-01-27 16:16:56,727 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 62 selfloop transitions, 8 changer transitions 4/81 dead transitions. [2024-01-27 16:16:56,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 328 flow [2024-01-27 16:16:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-01-27 16:16:56,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-01-27 16:16:56,732 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 118 flow. Second operand 4 states and 120 transitions. [2024-01-27 16:16:56,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 328 flow [2024-01-27 16:16:56,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:56,736 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 148 flow [2024-01-27 16:16:56,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2024-01-27 16:16:56,737 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-01-27 16:16:56,738 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 148 flow [2024-01-27 16:16:56,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-01-27 16:16:56,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:56,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:16:56,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:16:56,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -900145956, now seen corresponding path program 1 times [2024-01-27 16:16:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:56,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997714509] [2024-01-27 16:16:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997714509] [2024-01-27 16:16:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997714509] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:16:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503185541] [2024-01-27 16:16:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:56,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:16:56,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 16:16:56,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:56,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:16:56,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:57,159 INFO L124 PetriNetUnfolderBase]: 1808/3194 cut-off events. [2024-01-27 16:16:57,159 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2024-01-27 16:16:57,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7015 conditions, 3194 events. 1808/3194 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 18983 event pairs, 933 based on Foata normal form. 0/3012 useless extension candidates. Maximal degree in co-relation 5928. Up to 2152 conditions per place. [2024-01-27 16:16:57,171 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 52 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2024-01-27 16:16:57,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 312 flow [2024-01-27 16:16:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-27 16:16:57,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2024-01-27 16:16:57,175 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 148 flow. Second operand 3 states and 113 transitions. [2024-01-27 16:16:57,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 312 flow [2024-01-27 16:16:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:57,180 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 197 flow [2024-01-27 16:16:57,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2024-01-27 16:16:57,181 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2024-01-27 16:16:57,181 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 197 flow [2024-01-27 16:16:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 16:16:57,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:57,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:57,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:16:57,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:16:57,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2134720408, now seen corresponding path program 1 times [2024-01-27 16:16:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303907982] [2024-01-27 16:16:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:16:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303907982] [2024-01-27 16:16:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303907982] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:16:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146810262] [2024-01-27 16:16:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:57,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:57,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:16:57,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-01-27 16:16:57,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:57,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:16:57,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:57,612 INFO L124 PetriNetUnfolderBase]: 2166/3817 cut-off events. [2024-01-27 16:16:57,612 INFO L125 PetriNetUnfolderBase]: For 2497/2497 co-relation queries the response was YES. [2024-01-27 16:16:57,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9706 conditions, 3817 events. 2166/3817 cut-off events. For 2497/2497 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23313 event pairs, 1183 based on Foata normal form. 0/3701 useless extension candidates. Maximal degree in co-relation 1059. Up to 2585 conditions per place. [2024-01-27 16:16:57,629 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 56 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-01-27 16:16:57,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 425 flow [2024-01-27 16:16:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-01-27 16:16:57,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-01-27 16:16:57,630 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 197 flow. Second operand 3 states and 112 transitions. [2024-01-27 16:16:57,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 425 flow [2024-01-27 16:16:57,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 385 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:57,635 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 291 flow [2024-01-27 16:16:57,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=291, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2024-01-27 16:16:57,636 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-01-27 16:16:57,636 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 291 flow [2024-01-27 16:16:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-01-27 16:16:57,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:57,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:57,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:16:57,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:16:57,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2048934444, now seen corresponding path program 1 times [2024-01-27 16:16:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732189434] [2024-01-27 16:16:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:57,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:16:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:57,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:16:57,691 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:16:57,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-01-27 16:16:57,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-01-27 16:16:57,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-01-27 16:16:57,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-01-27 16:16:57,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-01-27 16:16:57,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-01-27 16:16:57,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-01-27 16:16:57,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-01-27 16:16:57,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:16:57,694 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-01-27 16:16:57,698 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:16:57,698 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:16:57,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:16:57 BasicIcfg [2024-01-27 16:16:57,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:16:57,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:16:57,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:16:57,720 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:16:57,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:54" (3/4) ... [2024-01-27 16:16:57,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:16:57,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:16:57,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:16:57,752 INFO L158 Benchmark]: Toolchain (without parser) took 4513.83ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 132.5MB in the beginning and 96.2MB in the end (delta: 36.4MB). Peak memory consumption was 181.7MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,753 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 72.0MB in the beginning and 72.0MB in the end (delta: 82.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:16:57,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.71ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 97.8MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.83ms. Allocated memory is still 169.9MB. Free memory was 97.8MB in the beginning and 94.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,753 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 169.9MB. Free memory was 94.9MB in the beginning and 90.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,754 INFO L158 Benchmark]: RCFGBuilder took 976.95ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 96.8MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,754 INFO L158 Benchmark]: TraceAbstraction took 2868.71ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 95.7MB in the beginning and 101.4MB in the end (delta: -5.7MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,754 INFO L158 Benchmark]: Witness Printer took 31.75ms. Allocated memory is still 314.6MB. Free memory was 101.4MB in the beginning and 96.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-27 16:16:57,755 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.18ms. Allocated memory is still 100.7MB. Free memory was 72.0MB in the beginning and 72.0MB in the end (delta: 82.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.71ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 97.8MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.83ms. Allocated memory is still 169.9MB. Free memory was 97.8MB in the beginning and 94.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 169.9MB. Free memory was 94.9MB in the beginning and 90.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 976.95ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 96.8MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2868.71ms. Allocated memory was 169.9MB in the beginning and 314.6MB in the end (delta: 144.7MB). Free memory was 95.7MB in the beginning and 101.4MB in the end (delta: -5.7MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. * Witness Printer took 31.75ms. Allocated memory is still 314.6MB. Free memory was 101.4MB in the beginning and 96.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, res=0, t1={3:0}, t2={4:0}] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L3933] 0 data->shared.a = 3 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L3907] 1 data->shared.a = 1 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L3936] 0 data->shared.b = 3 VAL [arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L3939] EXPR 0 data->shared.a [L3939] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\old(expression)=0, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 68 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 10 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-01-27 16:16:57,778 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