./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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_4-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 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:30:21,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:30:21,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:30:21,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:30:21,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:30:21,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:30:21,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:30:21,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:30:21,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:30:21,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:30:21,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:30:21,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:30:21,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:30:21,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:30:21,722 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:30:21,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:30:21,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:30:21,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:30:21,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:30:21,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:30:21,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:30:21,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:30:21,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:30:21,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:30:21,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:30:21,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:30:21,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:30:21,725 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:30:21,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:30:21,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:30:21,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:30:21,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:30:21,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:21,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:30:21,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:30:21,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:30:21,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:30:21,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:30:21,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:30:21,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:30:21,728 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:30:21,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:30:21,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:30:21,729 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-06-27 17:30:21,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:30:21,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:30:21,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:30:21,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:30:21,948 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:30:21,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2024-06-27 17:30:22,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:30:23,247 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:30:23,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2024-06-27 17:30:23,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff34f7811/7ab81064ce564e2eb152279e693f7266/FLAG0a37a52be [2024-06-27 17:30:23,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff34f7811/7ab81064ce564e2eb152279e693f7266 [2024-06-27 17:30:23,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:30:23,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:30:23,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:23,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:30:23,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:30:23,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3312fcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23, skipping insertion in model container [2024-06-27 17:30:23,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,382 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:30:23,610 WARN L247 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_4-container_of.i[186287,186300] [2024-06-27 17:30:23,638 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:23,645 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:30:23,690 WARN L247 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_4-container_of.i[186287,186300] [2024-06-27 17:30:23,700 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:30:23,754 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:30:23,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23 WrapperNode [2024-06-27 17:30:23,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:30:23,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:23,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:30:23,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:30:23,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,830 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2024-06-27 17:30:23,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:30:23,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:30:23,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:30:23,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:30:23,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,879 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-06-27 17:30:23,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:30:23,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:30:23,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:30:23,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:30:23,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (1/1) ... [2024-06-27 17:30:23,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:30:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:30:23,948 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-06-27 17:30:23,969 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-06-27 17:30:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-06-27 17:30:24,003 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-06-27 17:30:24,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:30:24,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:30:24,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:30:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:30:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:30:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:30:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:30:24,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:30:24,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:30:24,008 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:30:24,194 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:30:24,196 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:30:24,434 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:30:24,435 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:30:24,589 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:30:24,589 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:30:24,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:24 BoogieIcfgContainer [2024-06-27 17:30:24,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:30:24,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:30:24,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:30:24,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:30:24,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:30:23" (1/3) ... [2024-06-27 17:30:24,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff48d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:24, skipping insertion in model container [2024-06-27 17:30:24,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:30:23" (2/3) ... [2024-06-27 17:30:24,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff48d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:30:24, skipping insertion in model container [2024-06-27 17:30:24,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:24" (3/3) ... [2024-06-27 17:30:24,597 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-06-27 17:30:24,603 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:30:24,611 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:30:24,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 17:30:24,611 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:30:24,654 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:30:24,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 138 flow [2024-06-27 17:30:24,721 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2024-06-27 17:30:24,721 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:30:24,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 8/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2024-06-27 17:30:24,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 62 transitions, 138 flow [2024-06-27 17:30:24,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 122 flow [2024-06-27 17:30:24,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:30:24,746 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;@66d3948b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:30:24,747 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 17:30:24,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:30:24,753 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2024-06-27 17:30:24,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:30:24,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:24,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:24,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:24,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -514444511, now seen corresponding path program 1 times [2024-06-27 17:30:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989875786] [2024-06-27 17:30:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989875786] [2024-06-27 17:30:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989875786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:30:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65042146] [2024-06-27 17:30:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:25,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:30:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:25,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:30:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:30:25,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2024-06-27 17:30:25,381 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-06-27 17:30:25,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:25,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2024-06-27 17:30:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:25,846 INFO L124 PetriNetUnfolderBase]: 1534/2551 cut-off events. [2024-06-27 17:30:25,846 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-06-27 17:30:25,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 2551 events. 1534/2551 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13157 event pairs, 1309 based on Foata normal form. 2/2398 useless extension candidates. Maximal degree in co-relation 4938. Up to 2130 conditions per place. [2024-06-27 17:30:25,860 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 52 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2024-06-27 17:30:25,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 256 flow [2024-06-27 17:30:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:30:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:30:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-06-27 17:30:25,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-06-27 17:30:25,886 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 3 states and 91 transitions. [2024-06-27 17:30:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 256 flow [2024-06-27 17:30:25,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:30:25,896 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 116 flow [2024-06-27 17:30:25,898 INFO L264 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-06-27 17:30:25,902 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-06-27 17:30:25,902 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 116 flow [2024-06-27 17:30:25,902 INFO L496 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-06-27 17:30:25,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:25,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:25,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:30:25,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:25,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -514381129, now seen corresponding path program 1 times [2024-06-27 17:30:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226673675] [2024-06-27 17:30:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226673675] [2024-06-27 17:30:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226673675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050550920] [2024-06-27 17:30:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:25,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:25,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-06-27 17:30:25,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-06-27 17:30:25,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:25,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-06-27 17:30:25,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,246 INFO L124 PetriNetUnfolderBase]: 1309/2209 cut-off events. [2024-06-27 17:30:26,247 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-06-27 17:30:26,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 2209 events. 1309/2209 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11399 event pairs, 1309 based on Foata normal form. 1/2074 useless extension candidates. Maximal degree in co-relation 3566. Up to 2119 conditions per place. [2024-06-27 17:30:26,255 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-06-27 17:30:26,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 208 flow [2024-06-27 17:30:26,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-06-27 17:30:26,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2024-06-27 17:30:26,258 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 116 flow. Second operand 4 states and 114 transitions. [2024-06-27 17:30:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 208 flow [2024-06-27 17:30:26,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:26,260 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 117 flow [2024-06-27 17:30:26,260 INFO L264 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2024-06-27 17:30:26,261 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-27 17:30:26,261 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 117 flow [2024-06-27 17:30:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-06-27 17:30:26,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:26,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:30:26,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:26,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -459888639, now seen corresponding path program 1 times [2024-06-27 17:30:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624471123] [2024-06-27 17:30:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624471123] [2024-06-27 17:30:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624471123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:26,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:30:26,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604091485] [2024-06-27 17:30:26,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:26,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:30:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:30:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:30:26,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2024-06-27 17:30:26,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 117 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-06-27 17:30:26,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:26,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2024-06-27 17:30:26,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:26,905 INFO L124 PetriNetUnfolderBase]: 1781/3023 cut-off events. [2024-06-27 17:30:26,906 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-06-27 17:30:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 3023 events. 1781/3023 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16671 event pairs, 1208 based on Foata normal form. 121/3007 useless extension candidates. Maximal degree in co-relation 6088. Up to 2067 conditions per place. [2024-06-27 17:30:26,932 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 62 selfloop transitions, 8 changer transitions 5/81 dead transitions. [2024-06-27 17:30:26,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 327 flow [2024-06-27 17:30:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:30:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:30:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-06-27 17:30:26,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2024-06-27 17:30:26,935 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 117 flow. Second operand 4 states and 116 transitions. [2024-06-27 17:30:26,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 327 flow [2024-06-27 17:30:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:30:26,938 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 150 flow [2024-06-27 17:30:26,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=150, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-27 17:30:26,939 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-06-27 17:30:26,939 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 150 flow [2024-06-27 17:30:26,939 INFO L496 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-06-27 17:30:26,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:26,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:26,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:30:26,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:26,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1074804694, now seen corresponding path program 1 times [2024-06-27 17:30:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134701948] [2024-06-27 17:30:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134701948] [2024-06-27 17:30:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134701948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:27,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:30:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212528625] [2024-06-27 17:30:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:27,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:30:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:30:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:30:27,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-06-27 17:30:27,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06-27 17:30:27,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:27,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-06-27 17:30:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:27,616 INFO L124 PetriNetUnfolderBase]: 1768/3072 cut-off events. [2024-06-27 17:30:27,616 INFO L125 PetriNetUnfolderBase]: For 746/746 co-relation queries the response was YES. [2024-06-27 17:30:27,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 3072 events. 1768/3072 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17877 event pairs, 919 based on Foata normal form. 0/2887 useless extension candidates. Maximal degree in co-relation 5915. Up to 2102 conditions per place. [2024-06-27 17:30:27,644 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 55 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2024-06-27 17:30:27,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 328 flow [2024-06-27 17:30:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:30:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:30:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-27 17:30:27,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-06-27 17:30:27,661 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 150 flow. Second operand 3 states and 113 transitions. [2024-06-27 17:30:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 328 flow [2024-06-27 17:30:27,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 311 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 17:30:27,665 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 195 flow [2024-06-27 17:30:27,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2024-06-27 17:30:27,665 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2024-06-27 17:30:27,665 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 195 flow [2024-06-27 17:30:27,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06-27 17:30:27,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:27,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:27,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:30:27,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:27,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1040793309, now seen corresponding path program 1 times [2024-06-27 17:30:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806111662] [2024-06-27 17:30:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:30:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:30:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:30:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806111662] [2024-06-27 17:30:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806111662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:30:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:30:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:30:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849516574] [2024-06-27 17:30:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:30:27,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:30:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:30:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:30:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:30:27,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2024-06-27 17:30:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:30:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:30:27,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2024-06-27 17:30:27,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:30:28,087 INFO L124 PetriNetUnfolderBase]: 2086/3618 cut-off events. [2024-06-27 17:30:28,087 INFO L125 PetriNetUnfolderBase]: For 2140/2140 co-relation queries the response was YES. [2024-06-27 17:30:28,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9247 conditions, 3618 events. 2086/3618 cut-off events. For 2140/2140 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 21466 event pairs, 1168 based on Foata normal form. 0/3496 useless extension candidates. Maximal degree in co-relation 3014. Up to 2485 conditions per place. [2024-06-27 17:30:28,107 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 59 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2024-06-27 17:30:28,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 437 flow [2024-06-27 17:30:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:30:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:30:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-06-27 17:30:28,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2024-06-27 17:30:28,108 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 195 flow. Second operand 3 states and 112 transitions. [2024-06-27 17:30:28,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 437 flow [2024-06-27 17:30:28,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 397 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 17:30:28,116 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 289 flow [2024-06-27 17:30:28,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2024-06-27 17:30:28,116 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2024-06-27 17:30:28,117 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 289 flow [2024-06-27 17:30:28,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:30:28,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:30:28,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:30:28,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:30:28,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-06-27 17:30:28,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:30:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1171513412, now seen corresponding path program 1 times [2024-06-27 17:30:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:30:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543329209] [2024-06-27 17:30:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:30:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:30:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:28,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:30:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:30:28,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:30:28,179 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:30:28,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-06-27 17:30:28,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-06-27 17:30:28,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-06-27 17:30:28,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-06-27 17:30:28,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-06-27 17:30:28,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-06-27 17:30:28,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-27 17:30:28,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-27 17:30:28,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:30:28,183 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-06-27 17:30:28,187 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:30:28,187 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:30:28,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:30:28 BasicIcfg [2024-06-27 17:30:28,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:30:28,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:30:28,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:30:28,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:30:28,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:30:24" (3/4) ... [2024-06-27 17:30:28,215 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:30:28,249 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:30:28,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:30:28,249 INFO L158 Benchmark]: Toolchain (without parser) took 4961.80ms. Allocated memory was 159.4MB in the beginning and 415.2MB in the end (delta: 255.9MB). Free memory was 81.2MB in the beginning and 357.3MB in the end (delta: -276.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:28,250 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:28,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.25ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 81.1MB in the beginning and 155.0MB in the end (delta: -73.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-06-27 17:30:28,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.73ms. Allocated memory is still 213.9MB. Free memory was 155.0MB in the beginning and 151.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:30:28,250 INFO L158 Benchmark]: Boogie Preprocessor took 89.12ms. Allocated memory is still 213.9MB. Free memory was 151.9MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:30:28,251 INFO L158 Benchmark]: RCFGBuilder took 669.08ms. Allocated memory is still 213.9MB. Free memory was 148.7MB in the beginning and 104.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-27 17:30:28,251 INFO L158 Benchmark]: TraceAbstraction took 3621.73ms. Allocated memory was 213.9MB in the beginning and 415.2MB in the end (delta: 201.3MB). Free memory was 103.6MB in the beginning and 361.5MB in the end (delta: -257.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:30:28,251 INFO L158 Benchmark]: Witness Printer took 35.62ms. Allocated memory is still 415.2MB. Free memory was 361.5MB in the beginning and 357.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:30:28,252 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 159.4MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.25ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 81.1MB in the beginning and 155.0MB in the end (delta: -73.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.73ms. Allocated memory is still 213.9MB. Free memory was 155.0MB in the beginning and 151.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.12ms. Allocated memory is still 213.9MB. Free memory was 151.9MB in the beginning and 148.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 669.08ms. Allocated memory is still 213.9MB. Free memory was 148.7MB in the beginning and 104.7MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3621.73ms. Allocated memory was 213.9MB in the beginning and 415.2MB in the end (delta: 201.3MB). Free memory was 103.6MB in the beginning and 361.5MB in the end (delta: -257.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 35.62ms. Allocated memory is still 415.2MB. Free memory was 361.5MB in the beginning and 357.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, res=0, t1=-1, t2=0] [L3931] 0 return 0; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result=0, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, res=0, t1=-1, t2=0] [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}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, status={5:0}, t1=-1, t2=0] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3946] EXPR 0 data->shared.a [L3946] 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, arg={6:24}, data={6:0}, dev={6:24}, expression=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: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 11 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-06-27 17:30:28,272 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