./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:20:15,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:20:15,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:20:15,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:20:15,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:20:15,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:20:15,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:20:15,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:20:15,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:20:15,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:20:15,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:20:15,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:20:15,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:20:15,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:20:15,741 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:20:15,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:20:15,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:20:15,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:20:15,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:20:15,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:20:15,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:20:15,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:20:15,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:20:15,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:20:15,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:20:15,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:20:15,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:20:15,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:20:15,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:20:15,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:20:15,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:20:15,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:20:15,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:20:15,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:20:15,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:20:15,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:20:15,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:20:15,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:20:15,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:20:15,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:20:15,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:20:15,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:20:15,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-10-11 14:20:15,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:20:15,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:20:15,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:20:15,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:20:15,950 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:20:15,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-11 14:20:17,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:20:17,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:20:17,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-11 14:20:17,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1bb12d6d9/27ef861b18824224a99cb197b7227e9b/FLAG0b1df54ec [2024-10-11 14:20:17,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1bb12d6d9/27ef861b18824224a99cb197b7227e9b [2024-10-11 14:20:17,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:20:17,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:20:17,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:20:17,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:20:17,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:20:17,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:17" (1/1) ... [2024-10-11 14:20:17,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d3c3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:17, skipping insertion in model container [2024-10-11 14:20:17,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:20:17" (1/1) ... [2024-10-11 14:20:17,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:20:17,838 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i[186287,186300] [2024-10-11 14:20:17,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:20:17,891 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:20:17,943 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i[186287,186300] [2024-10-11 14:20:17,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:20:18,022 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:20:18,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18 WrapperNode [2024-10-11 14:20:18,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:20:18,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:20:18,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:20:18,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:20:18,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,078 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2024-10-11 14:20:18,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:20:18,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:20:18,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:20:18,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:20:18,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,109 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 8, 2]. [2024-10-11 14:20:18,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:20:18,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:20:18,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:20:18,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:20:18,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (1/1) ... [2024-10-11 14:20:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:20:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:20:18,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:20:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:20:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-11 14:20:18,207 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:20:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:20:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:20:18,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:20:18,210 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:20:18,394 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:20:18,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:20:18,608 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:20:18,608 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:20:18,724 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:20:18,724 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:20:18,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:18 BoogieIcfgContainer [2024-10-11 14:20:18,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:20:18,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:20:18,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:20:18,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:20:18,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:20:17" (1/3) ... [2024-10-11 14:20:18,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfc20ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:18, skipping insertion in model container [2024-10-11 14:20:18,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:20:18" (2/3) ... [2024-10-11 14:20:18,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfc20ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:20:18, skipping insertion in model container [2024-10-11 14:20:18,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:18" (3/3) ... [2024-10-11 14:20:18,732 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-10-11 14:20:18,744 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:20:18,745 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 14:20:18,745 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:20:18,777 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:20:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 138 flow [2024-10-11 14:20:18,840 INFO L124 PetriNetUnfolderBase]: 8/75 cut-off events. [2024-10-11 14:20:18,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:20:18,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 8/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 161 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2024-10-11 14:20:18,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 62 transitions, 138 flow [2024-10-11 14:20:18,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 122 flow [2024-10-11 14:20:18,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:20:18,856 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;@54b36542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:20:18,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 14:20:18,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:20:18,862 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-10-11 14:20:18,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:20:18,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:18,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:18,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:18,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2061936771, now seen corresponding path program 1 times [2024-10-11 14:20:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880256447] [2024-10-11 14:20:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:19,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880256447] [2024-10-11 14:20:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880256447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:19,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:19,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:20:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176960667] [2024-10-11 14:20:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:19,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:20:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:20:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:20:19,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2024-10-11 14:20:19,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-11 14:20:19,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:19,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2024-10-11 14:20:19,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:19,718 INFO L124 PetriNetUnfolderBase]: 904/1563 cut-off events. [2024-10-11 14:20:19,718 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-11 14:20:19,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1563 events. 904/1563 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7447 event pairs, 679 based on Foata normal form. 2/1536 useless extension candidates. Maximal degree in co-relation 2810. Up to 1158 conditions per place. [2024-10-11 14:20:19,733 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 52 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2024-10-11 14:20:19,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 256 flow [2024-10-11 14:20:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:20:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:20:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-10-11 14:20:19,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-10-11 14:20:19,750 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 3 states and 91 transitions. [2024-10-11 14:20:19,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 256 flow [2024-10-11 14:20:19,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:20:19,757 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 116 flow [2024-10-11 14:20:19,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2024-10-11 14:20:19,763 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-10-11 14:20:19,764 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 116 flow [2024-10-11 14:20:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-11 14:20:19,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:19,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:19,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:20:19,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:19,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1541266083, now seen corresponding path program 1 times [2024-10-11 14:20:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969048483] [2024-10-11 14:20:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:19,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:19,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969048483] [2024-10-11 14:20:19,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969048483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:19,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:19,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:20:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269904759] [2024-10-11 14:20:19,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:19,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:20:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:20:19,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:20:19,965 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2024-10-11 14:20:19,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-11 14:20:19,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:19,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2024-10-11 14:20:19,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:20,300 INFO L124 PetriNetUnfolderBase]: 1152/2056 cut-off events. [2024-10-11 14:20:20,300 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-10-11 14:20:20,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 2056 events. 1152/2056 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11032 event pairs, 578 based on Foata normal form. 120/2153 useless extension candidates. Maximal degree in co-relation 1637. Up to 1102 conditions per place. [2024-10-11 14:20:20,309 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 62 selfloop transitions, 8 changer transitions 4/80 dead transitions. [2024-10-11 14:20:20,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 326 flow [2024-10-11 14:20:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:20:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:20:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-10-11 14:20:20,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-10-11 14:20:20,311 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 116 flow. Second operand 4 states and 116 transitions. [2024-10-11 14:20:20,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 326 flow [2024-10-11 14:20:20,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:20,315 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 146 flow [2024-10-11 14:20:20,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-10-11 14:20:20,316 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-10-11 14:20:20,316 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 146 flow [2024-10-11 14:20:20,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-10-11 14:20:20,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:20,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:20,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:20:20,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:20,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash -790131104, now seen corresponding path program 1 times [2024-10-11 14:20:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145349533] [2024-10-11 14:20:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145349533] [2024-10-11 14:20:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145349533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:20,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:20:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132485319] [2024-10-11 14:20:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:20,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:20:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:20:20,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:20:20,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2024-10-11 14:20:20,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10-11 14:20:20,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:20,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2024-10-11 14:20:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:20,538 INFO L124 PetriNetUnfolderBase]: 455/808 cut-off events. [2024-10-11 14:20:20,539 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-10-11 14:20:20,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 808 events. 455/808 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3378 event pairs, 63 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1757. Up to 475 conditions per place. [2024-10-11 14:20:20,542 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 60 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-10-11 14:20:20,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 296 flow [2024-10-11 14:20:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:20:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:20:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-10-11 14:20:20,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2024-10-11 14:20:20,544 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 146 flow. Second operand 4 states and 131 transitions. [2024-10-11 14:20:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 296 flow [2024-10-11 14:20:20,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 290 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:20:20,546 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 98 flow [2024-10-11 14:20:20,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-10-11 14:20:20,546 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2024-10-11 14:20:20,547 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 98 flow [2024-10-11 14:20:20,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-10-11 14:20:20,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:20,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:20:20,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 884816303, now seen corresponding path program 1 times [2024-10-11 14:20:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596642185] [2024-10-11 14:20:20,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596642185] [2024-10-11 14:20:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596642185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:20:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890421584] [2024-10-11 14:20:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:20,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:20:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:20:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:20:20,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-10-11 14:20:20,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10-11 14:20:20,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:20,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-10-11 14:20:20,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:20,839 INFO L124 PetriNetUnfolderBase]: 468/848 cut-off events. [2024-10-11 14:20:20,839 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-10-11 14:20:20,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 848 events. 468/848 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3390 event pairs, 416 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 432. Up to 763 conditions per place. [2024-10-11 14:20:20,843 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 42 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2024-10-11 14:20:20,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 223 flow [2024-10-11 14:20:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:20:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:20:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-11 14:20:20,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-10-11 14:20:20,845 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 98 flow. Second operand 3 states and 102 transitions. [2024-10-11 14:20:20,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 223 flow [2024-10-11 14:20:20,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:20,846 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 137 flow [2024-10-11 14:20:20,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-10-11 14:20:20,847 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2024-10-11 14:20:20,847 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 137 flow [2024-10-11 14:20:20,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-10-11 14:20:20,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:20,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:20,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:20:20,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:20,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 394890358, now seen corresponding path program 1 times [2024-10-11 14:20:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412512785] [2024-10-11 14:20:20,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412512785] [2024-10-11 14:20:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412512785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:20,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:20:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922893732] [2024-10-11 14:20:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:20,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:20:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:20:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:20:20,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-10-11 14:20:20,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-11 14:20:20,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:20,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-10-11 14:20:20,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:21,095 INFO L124 PetriNetUnfolderBase]: 477/875 cut-off events. [2024-10-11 14:20:21,095 INFO L125 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2024-10-11 14:20:21,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 875 events. 477/875 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3527 event pairs, 430 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1695. Up to 786 conditions per place. [2024-10-11 14:20:21,100 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-10-11 14:20:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 290 flow [2024-10-11 14:20:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:20:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:20:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-10-11 14:20:21,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2024-10-11 14:20:21,101 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 137 flow. Second operand 3 states and 101 transitions. [2024-10-11 14:20:21,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 290 flow [2024-10-11 14:20:21,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 266 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:21,108 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 183 flow [2024-10-11 14:20:21,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-10-11 14:20:21,109 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-10-11 14:20:21,109 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 183 flow [2024-10-11 14:20:21,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-11 14:20:21,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:21,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:21,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:20:21,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:21,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash 4684199, now seen corresponding path program 1 times [2024-10-11 14:20:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288039909] [2024-10-11 14:20:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288039909] [2024-10-11 14:20:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288039909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:20:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043812744] [2024-10-11 14:20:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:21,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:20:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:20:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:20:21,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-10-11 14:20:21,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 183 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-10-11 14:20:21,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:21,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-10-11 14:20:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:22,088 INFO L124 PetriNetUnfolderBase]: 541/997 cut-off events. [2024-10-11 14:20:22,089 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-10-11 14:20:22,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 997 events. 541/997 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4582 event pairs, 28 based on Foata normal form. 16/1002 useless extension candidates. Maximal degree in co-relation 2056. Up to 552 conditions per place. [2024-10-11 14:20:22,094 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 89 selfloop transitions, 18 changer transitions 0/114 dead transitions. [2024-10-11 14:20:22,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 114 transitions, 585 flow [2024-10-11 14:20:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:20:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:20:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 280 transitions. [2024-10-11 14:20:22,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-10-11 14:20:22,096 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 183 flow. Second operand 10 states and 280 transitions. [2024-10-11 14:20:22,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 114 transitions, 585 flow [2024-10-11 14:20:22,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 114 transitions, 569 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:20:22,100 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 288 flow [2024-10-11 14:20:22,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=288, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-10-11 14:20:22,100 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-10-11 14:20:22,101 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 288 flow [2024-10-11 14:20:22,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-10-11 14:20:22,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:22,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:22,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:20:22,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -595788987, now seen corresponding path program 2 times [2024-10-11 14:20:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046214834] [2024-10-11 14:20:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:20:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:20:22,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:20:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046214834] [2024-10-11 14:20:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046214834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:20:22,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:20:22,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:20:22,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677479186] [2024-10-11 14:20:22,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:20:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:20:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:20:22,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:20:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:20:22,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-10-11 14:20:22,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-10-11 14:20:22,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:20:22,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-10-11 14:20:22,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:20:22,979 INFO L124 PetriNetUnfolderBase]: 644/1207 cut-off events. [2024-10-11 14:20:22,979 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2024-10-11 14:20:22,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 1207 events. 644/1207 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5831 event pairs, 35 based on Foata normal form. 16/1190 useless extension candidates. Maximal degree in co-relation 3279. Up to 411 conditions per place. [2024-10-11 14:20:22,987 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 124 selfloop transitions, 31 changer transitions 0/162 dead transitions. [2024-10-11 14:20:22,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 162 transitions, 1004 flow [2024-10-11 14:20:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:20:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:20:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 340 transitions. [2024-10-11 14:20:22,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2024-10-11 14:20:22,989 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 288 flow. Second operand 12 states and 340 transitions. [2024-10-11 14:20:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 162 transitions, 1004 flow [2024-10-11 14:20:22,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 162 transitions, 1002 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:20:22,994 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 479 flow [2024-10-11 14:20:22,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=479, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2024-10-11 14:20:22,996 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-10-11 14:20:22,996 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 479 flow [2024-10-11 14:20:22,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-10-11 14:20:22,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:20:22,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:20:22,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:20:22,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-10-11 14:20:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:20:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash 913801035, now seen corresponding path program 3 times [2024-10-11 14:20:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:20:22,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427424553] [2024-10-11 14:20:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:20:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:20:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:20:23,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:20:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:20:23,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:20:23,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:20:23,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-10-11 14:20:23,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-10-11 14:20:23,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-10-11 14:20:23,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-10-11 14:20:23,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-10-11 14:20:23,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-10-11 14:20:23,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-11 14:20:23,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-10-11 14:20:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:20:23,083 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-10-11 14:20:23,128 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:20:23,128 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:20:23,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:20:23 BasicIcfg [2024-10-11 14:20:23,136 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:20:23,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:20:23,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:20:23,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:20:23,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:20:18" (3/4) ... [2024-10-11 14:20:23,139 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:20:23,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:20:23,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:20:23,197 INFO L158 Benchmark]: Toolchain (without parser) took 5749.38ms. Allocated memory was 218.1MB in the beginning and 360.7MB in the end (delta: 142.6MB). Free memory was 145.3MB in the beginning and 113.7MB in the end (delta: 31.5MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,198 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:20:23,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.31ms. Allocated memory is still 218.1MB. Free memory was 145.0MB in the beginning and 173.9MB in the end (delta: -29.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 218.1MB. Free memory was 173.9MB in the beginning and 171.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,198 INFO L158 Benchmark]: Boogie Preprocessor took 48.20ms. Allocated memory is still 218.1MB. Free memory was 171.7MB in the beginning and 167.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,198 INFO L158 Benchmark]: RCFGBuilder took 596.81ms. Allocated memory is still 218.1MB. Free memory was 167.4MB in the beginning and 123.6MB in the end (delta: 43.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,200 INFO L158 Benchmark]: TraceAbstraction took 4408.50ms. Allocated memory was 218.1MB in the beginning and 360.7MB in the end (delta: 142.6MB). Free memory was 123.6MB in the beginning and 122.1MB in the end (delta: 1.5MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,200 INFO L158 Benchmark]: Witness Printer took 57.50ms. Allocated memory is still 360.7MB. Free memory was 122.1MB in the beginning and 113.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:20:23,201 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.12ms. Allocated memory is still 117.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.31ms. Allocated memory is still 218.1MB. Free memory was 145.0MB in the beginning and 173.9MB in the end (delta: -29.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 218.1MB. Free memory was 173.9MB in the beginning and 171.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.20ms. Allocated memory is still 218.1MB. Free memory was 171.7MB in the beginning and 167.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.81ms. Allocated memory is still 218.1MB. Free memory was 167.4MB in the beginning and 123.6MB in the end (delta: 43.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4408.50ms. Allocated memory was 218.1MB in the beginning and 360.7MB in the end (delta: 142.6MB). Free memory was 123.6MB in the beginning and 122.1MB in the end (delta: 1.5MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. * Witness Printer took 57.50ms. Allocated memory is still 360.7MB. Free memory was 122.1MB in the beginning and 113.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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; [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, EXPR 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 [\old(arg)={6:24}, \old(data)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=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 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-1, t2=0] [L3931] 0 return 0; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result=0, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\old(arg)={6:24}, \old(expression)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-1, t2=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, 67 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: 4.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 11 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=7, InterpolantAutomatonStates: 39, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-10-11 14:20:23,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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