./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_5-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_5-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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:16:53,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:16:53,079 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:53,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:16:53,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:16:53,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:16:53,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:16:53,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:16:53,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:16:53,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:16:53,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:16:53,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:16:53,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:16:53,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:16:53,119 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:16:53,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:16:53,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:16:53,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:16:53,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:16:53,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:16:53,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:16:53,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:16:53,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:16:53,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:16:53,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:16:53,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:16:53,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:16:53,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:16:53,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:16:53,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:16:53,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:16:53,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:16:53,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:53,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:16:53,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:16:53,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:16:53,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:16:53,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:16:53,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:16:53,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:16:53,126 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:16:53,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:16:53,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:16:53,127 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-01-27 16:16:53,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:16:53,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:16:53,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:16:53,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:16:53,378 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:16:53,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-01-27 16:16:54,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:16:54,857 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:16:54,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-01-27 16:16:54,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c774f011/46849fbd831a437188adf37d35b652b7/FLAG3bd0e83de [2024-01-27 16:16:54,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c774f011/46849fbd831a437188adf37d35b652b7 [2024-01-27 16:16:54,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:16:54,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:16:54,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:54,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:16:54,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:16:54,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cdce2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:54, skipping insertion in model container [2024-01-27 16:16:54,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:54" (1/1) ... [2024-01-27 16:16:54,983 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:16:55,327 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_5-container_of.i[186287,186300] [2024-01-27 16:16:55,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:55,436 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:16:55,536 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_5-container_of.i[186287,186300] [2024-01-27 16:16:55,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:55,623 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:16:55,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:55 WrapperNode [2024-01-27 16:16:55,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:55,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:55,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:16:55,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:16:55,632 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:55" (1/1) ... [2024-01-27 16:16:55,663 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:55" (1/1) ... [2024-01-27 16:16:55,699 INFO L138 Inliner]: procedures = 248, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2024-01-27 16:16:55,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:55,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:16:55,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:16:55,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:16:55,709 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:55" (1/1) ... [2024-01-27 16:16:55,710 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:55" (1/1) ... [2024-01-27 16:16:55,724 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:55" (1/1) ... [2024-01-27 16:16:55,743 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:55,746 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:55" (1/1) ... [2024-01-27 16:16:55,746 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:55" (1/1) ... [2024-01-27 16:16:55,763 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:55" (1/1) ... [2024-01-27 16:16:55,777 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:55" (1/1) ... [2024-01-27 16:16:55,781 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:55" (1/1) ... [2024-01-27 16:16:55,796 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:55" (1/1) ... [2024-01-27 16:16:55,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:16:55,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:16:55,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:16:55,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:16:55,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:55" (1/1) ... [2024-01-27 16:16:55,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:16:55,856 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:55,864 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:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-01-27 16:16:55,904 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-01-27 16:16:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:16:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:16:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-27 16:16:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:16:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:16:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:16:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:16:55,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:16:55,911 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:56,134 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:16:56,136 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:16:56,350 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:16:56,350 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:16:56,441 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:16:56,441 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:16:56,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:56 BoogieIcfgContainer [2024-01-27 16:16:56,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:16:56,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:16:56,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:16:56,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:16:56,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:16:54" (1/3) ... [2024-01-27 16:16:56,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a85c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:56, skipping insertion in model container [2024-01-27 16:16:56,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:55" (2/3) ... [2024-01-27 16:16:56,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a85c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:56, skipping insertion in model container [2024-01-27 16:16:56,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:56" (3/3) ... [2024-01-27 16:16:56,448 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-01-27 16:16:56,454 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:16:56,461 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:16:56,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-01-27 16:16:56,462 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:16:56,500 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:16:56,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 63 transitions, 140 flow [2024-01-27 16:16:56,571 INFO L124 PetriNetUnfolderBase]: 8/76 cut-off events. [2024-01-27 16:16:56,571 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:16:56,575 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 7. Compared 162 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2024-01-27 16:16:56,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 63 transitions, 140 flow [2024-01-27 16:16:56,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 56 transitions, 124 flow [2024-01-27 16:16:56,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:16:56,597 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;@1f3c1fb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:16:56,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-01-27 16:16:56,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:16:56,605 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2024-01-27 16:16:56,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:16:56,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:56,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:56,606 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:56,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1841686365, now seen corresponding path program 1 times [2024-01-27 16:16:56,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:56,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301807999] [2024-01-27 16:16:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:57,186 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,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301807999] [2024-01-27 16:16:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301807999] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:16:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759239600] [2024-01-27 16:16:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:57,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:57,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2024-01-27 16:16:57,250 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:57,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:57,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2024-01-27 16:16:57,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:57,566 INFO L124 PetriNetUnfolderBase]: 904/1567 cut-off events. [2024-01-27 16:16:57,566 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-01-27 16:16:57,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1567 events. 904/1567 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7458 event pairs, 679 based on Foata normal form. 2/1540 useless extension candidates. Maximal degree in co-relation 2806. Up to 1158 conditions per place. [2024-01-27 16:16:57,580 INFO L140 encePairwiseOnDemand]: 54/63 looper letters, 52 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2024-01-27 16:16:57,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 258 flow [2024-01-27 16:16:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-01-27 16:16:57,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2024-01-27 16:16:57,594 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:57,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 258 flow [2024-01-27 16:16:57,599 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:57,604 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 118 flow [2024-01-27 16:16:57,606 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:57,609 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2024-01-27 16:16:57,609 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 118 flow [2024-01-27 16:16:57,609 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:57,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:57,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:57,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:16:57,610 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:57,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash 334118717, now seen corresponding path program 1 times [2024-01-27 16:16:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543902978] [2024-01-27 16:16:57,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:57,817 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,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543902978] [2024-01-27 16:16:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543902978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:57,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511107720] [2024-01-27 16:16:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:57,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2024-01-27 16:16:57,834 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:57,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:57,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2024-01-27 16:16:57,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:58,157 INFO L124 PetriNetUnfolderBase]: 1152/2060 cut-off events. [2024-01-27 16:16:58,157 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-01-27 16:16:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4232 conditions, 2060 events. 1152/2060 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11015 event pairs, 578 based on Foata normal form. 120/2157 useless extension candidates. Maximal degree in co-relation 1641. Up to 1102 conditions per place. [2024-01-27 16:16:58,168 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 62 selfloop transitions, 8 changer transitions 4/81 dead transitions. [2024-01-27 16:16:58,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 328 flow [2024-01-27 16:16:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-01-27 16:16:58,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-01-27 16:16:58,174 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:58,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 328 flow [2024-01-27 16:16:58,176 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:58,178 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 148 flow [2024-01-27 16:16:58,178 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:58,179 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-01-27 16:16:58,179 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 148 flow [2024-01-27 16:16:58,179 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:58,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:58,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:16:58,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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:58,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1451982384, now seen corresponding path program 1 times [2024-01-27 16:16:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709928451] [2024-01-27 16:16:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:58,259 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:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709928451] [2024-01-27 16:16:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709928451] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:58,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:58,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419569879] [2024-01-27 16:16:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:58,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:58,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:58,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 63 [2024-01-27 16:16:58,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:58,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:58,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 63 [2024-01-27 16:16:58,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:58,401 INFO L124 PetriNetUnfolderBase]: 455/816 cut-off events. [2024-01-27 16:16:58,401 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-01-27 16:16:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 816 events. 455/816 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3553 event pairs, 63 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1765. Up to 475 conditions per place. [2024-01-27 16:16:58,405 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 60 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-01-27 16:16:58,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 298 flow [2024-01-27 16:16:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-01-27 16:16:58,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-01-27 16:16:58,406 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 148 flow. Second operand 4 states and 135 transitions. [2024-01-27 16:16:58,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 298 flow [2024-01-27 16:16:58,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 292 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:16:58,408 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 100 flow [2024-01-27 16:16:58,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-01-27 16:16:58,409 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2024-01-27 16:16:58,409 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 100 flow [2024-01-27 16:16:58,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:58,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:58,409 INFO L208 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-01-27 16:16:58,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:16:58,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:58,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash -73325097, now seen corresponding path program 1 times [2024-01-27 16:16:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412037298] [2024-01-27 16:16:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:58,563 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:58,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:58,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412037298] [2024-01-27 16:16:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412037298] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:58,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:16:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050248135] [2024-01-27 16:16:58,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:58,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:58,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:58,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:16:58,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:58,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:58,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:16:58,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:58,665 INFO L124 PetriNetUnfolderBase]: 468/856 cut-off events. [2024-01-27 16:16:58,666 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-01-27 16:16:58,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 856 events. 468/856 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3434 event pairs, 416 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 437. Up to 763 conditions per place. [2024-01-27 16:16:58,669 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 42 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-01-27 16:16:58,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 225 flow [2024-01-27 16:16:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-01-27 16:16:58,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-01-27 16:16:58,671 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 100 flow. Second operand 3 states and 105 transitions. [2024-01-27 16:16:58,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 225 flow [2024-01-27 16:16:58,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:58,672 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 139 flow [2024-01-27 16:16:58,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-01-27 16:16:58,673 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2024-01-27 16:16:58,673 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 139 flow [2024-01-27 16:16:58,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:58,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:58,673 INFO L208 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-01-27 16:16:58,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:16:58,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:58,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1574059888, now seen corresponding path program 1 times [2024-01-27 16:16:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:58,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855905405] [2024-01-27 16:16:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:58,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:58,816 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:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855905405] [2024-01-27 16:16:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855905405] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:16:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887332146] [2024-01-27 16:16:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:58,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:16:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:16:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:16:58,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:16:58,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:58,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:58,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:16:58,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:58,923 INFO L124 PetriNetUnfolderBase]: 477/892 cut-off events. [2024-01-27 16:16:58,923 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2024-01-27 16:16:58,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 892 events. 477/892 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3663 event pairs, 430 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1699. Up to 786 conditions per place. [2024-01-27 16:16:58,927 INFO L140 encePairwiseOnDemand]: 57/63 looper letters, 44 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2024-01-27 16:16:58,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 292 flow [2024-01-27 16:16:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:16:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:16:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-01-27 16:16:58,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2024-01-27 16:16:58,929 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 139 flow. Second operand 3 states and 104 transitions. [2024-01-27 16:16:58,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 292 flow [2024-01-27 16:16:58,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 268 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:58,931 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 185 flow [2024-01-27 16:16:58,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-01-27 16:16:58,932 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2024-01-27 16:16:58,932 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 185 flow [2024-01-27 16:16:58,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:58,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:58,933 INFO L208 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-01-27 16:16:58,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:16:58,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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:58,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 851484461, now seen corresponding path program 1 times [2024-01-27 16:16:58,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572490430] [2024-01-27 16:16:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:58,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:59,467 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:59,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572490430] [2024-01-27 16:16:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572490430] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:16:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082218886] [2024-01-27 16:16:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:59,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:16:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:16:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:16:59,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:16:59,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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:59,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:59,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:16:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:59,850 INFO L124 PetriNetUnfolderBase]: 541/1010 cut-off events. [2024-01-27 16:16:59,850 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2024-01-27 16:16:59,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1010 events. 541/1010 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4616 event pairs, 48 based on Foata normal form. 16/1015 useless extension candidates. Maximal degree in co-relation 2056. Up to 552 conditions per place. [2024-01-27 16:16:59,855 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 89 selfloop transitions, 18 changer transitions 0/115 dead transitions. [2024-01-27 16:16:59,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 115 transitions, 587 flow [2024-01-27 16:16:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:16:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:16:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 290 transitions. [2024-01-27 16:16:59,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-01-27 16:16:59,857 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 185 flow. Second operand 10 states and 290 transitions. [2024-01-27 16:16:59,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 115 transitions, 587 flow [2024-01-27 16:16:59,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 115 transitions, 571 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:59,862 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 290 flow [2024-01-27 16:16:59,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=290, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2024-01-27 16:16:59,864 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-01-27 16:16:59,864 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 290 flow [2024-01-27 16:16:59,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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:59,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:59,865 INFO L208 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-01-27 16:16:59,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:16:59,865 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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:59,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash -627204821, now seen corresponding path program 2 times [2024-01-27 16:16:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658336911] [2024-01-27 16:16:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:00,330 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:17:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658336911] [2024-01-27 16:17:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658336911] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:17:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052840609] [2024-01-27 16:17:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:00,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:17:00,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:00,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:17:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:17:00,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 63 [2024-01-27 16:17:00,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 290 flow. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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:17:00,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:00,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 63 [2024-01-27 16:17:00,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:00,809 INFO L124 PetriNetUnfolderBase]: 644/1225 cut-off events. [2024-01-27 16:17:00,810 INFO L125 PetriNetUnfolderBase]: For 1076/1076 co-relation queries the response was YES. [2024-01-27 16:17:00,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 1225 events. 644/1225 cut-off events. For 1076/1076 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6005 event pairs, 35 based on Foata normal form. 16/1208 useless extension candidates. Maximal degree in co-relation 3297. Up to 411 conditions per place. [2024-01-27 16:17:00,816 INFO L140 encePairwiseOnDemand]: 53/63 looper letters, 124 selfloop transitions, 31 changer transitions 0/163 dead transitions. [2024-01-27 16:17:00,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 163 transitions, 1006 flow [2024-01-27 16:17:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:17:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:17:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 352 transitions. [2024-01-27 16:17:00,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2024-01-27 16:17:00,828 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 290 flow. Second operand 12 states and 352 transitions. [2024-01-27 16:17:00,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 163 transitions, 1006 flow [2024-01-27 16:17:00,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 163 transitions, 1004 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:17:00,834 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 481 flow [2024-01-27 16:17:00,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=481, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-01-27 16:17:00,834 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2024-01-27 16:17:00,834 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 481 flow [2024-01-27 16:17:00,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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:17:00,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:00,835 INFO L208 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-01-27 16:17:00,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:17:00,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-01-27 16:17:00,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1420391539, now seen corresponding path program 3 times [2024-01-27 16:17:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:00,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713514572] [2024-01-27 16:17:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:00,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:17:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:01,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:17:01,006 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:17:01,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-01-27 16:17:01,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-01-27 16:17:01,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-01-27 16:17:01,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-01-27 16:17:01,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-01-27 16:17:01,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-01-27 16:17:01,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-01-27 16:17:01,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-01-27 16:17:01,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:17:01,012 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-01-27 16:17:01,016 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:17:01,026 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:17:01,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:17:01 BasicIcfg [2024-01-27 16:17:01,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:17:01,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:17:01,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:17:01,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:17:01,104 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:56" (3/4) ... [2024-01-27 16:17:01,105 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:17:01,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:17:01,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:17:01,213 INFO L158 Benchmark]: Toolchain (without parser) took 6306.78ms. Allocated memory was 138.4MB in the beginning and 308.3MB in the end (delta: 169.9MB). Free memory was 78.4MB in the beginning and 166.6MB in the end (delta: -88.2MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,213 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:17:01,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.14ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 78.4MB in the beginning and 142.0MB in the end (delta: -63.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.48ms. Allocated memory is still 182.5MB. Free memory was 142.0MB in the beginning and 138.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,213 INFO L158 Benchmark]: Boogie Preprocessor took 99.49ms. Allocated memory is still 182.5MB. Free memory was 138.9MB in the beginning and 134.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,214 INFO L158 Benchmark]: RCFGBuilder took 641.14ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 88.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,214 INFO L158 Benchmark]: TraceAbstraction took 4660.28ms. Allocated memory was 182.5MB in the beginning and 308.3MB in the end (delta: 125.8MB). Free memory was 87.5MB in the beginning and 175.0MB in the end (delta: -87.5MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,214 INFO L158 Benchmark]: Witness Printer took 108.40ms. Allocated memory is still 308.3MB. Free memory was 175.0MB in the beginning and 166.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:17:01,215 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.15ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.14ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 78.4MB in the beginning and 142.0MB in the end (delta: -63.7MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.48ms. Allocated memory is still 182.5MB. Free memory was 142.0MB in the beginning and 138.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.49ms. Allocated memory is still 182.5MB. Free memory was 138.9MB in the beginning and 134.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 641.14ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 88.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4660.28ms. Allocated memory was 182.5MB in the beginning and 308.3MB in the end (delta: 125.8MB). Free memory was 87.5MB in the beginning and 175.0MB in the end (delta: -87.5MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 108.40ms. Allocated memory is still 308.3MB. Free memory was 175.0MB in the beginning and 166.6MB 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; [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, 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 [arg={6:24}, d={6:24}, data={6:0}, data={6: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) );}) [L3907] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\result={0:0}, arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L3931] 0 return 0; VAL [\result=0, \result={0:0}, arg={6:24}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1={3:0}, t2={4: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 { 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; [L3938] 0 \read(t1) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L3941] 0 data->shared.a = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3907] 2 data->shared.a = 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L3944] 0 data->shared.b = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4: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(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=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: 4.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 12 mSDtfsCounter, 1173 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=481occurred 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-01-27 16:17:01,252 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