./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/pthread-ext/46_monabsex2_vs.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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:11:57,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:11:57,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:11:57,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:11:57,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:11:57,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:11:57,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:11:57,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:11:57,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:11:57,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:11:57,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:11:57,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:11:57,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:11:57,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:11:57,718 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:11:57,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:11:57,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:11:57,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:11:57,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:11:57,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:11:57,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:11:57,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:11:57,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:11:57,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:11:57,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:11:57,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:11:57,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:11:57,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:11:57,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:11:57,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:11:57,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:11:57,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:11:57,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:11:57,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:11:57,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:11:57,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:11:57,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:11:57,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:11:57,726 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:11:58,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:11:58,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:11:58,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:11:58,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:11:58,058 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:11:58,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-02-19 14:11:59,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:11:59,409 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:11:59,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2024-02-19 14:11:59,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbc0f2ca/72d3248bcfd64975ba23d9e985b9d5b0/FLAG4728c5019 [2024-02-19 14:11:59,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbc0f2ca/72d3248bcfd64975ba23d9e985b9d5b0 [2024-02-19 14:11:59,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:11:59,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:11:59,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:11:59,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:11:59,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:11:59,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603ac11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59, skipping insertion in model container [2024-02-19 14:11:59,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:11:59,785 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-02-19 14:11:59,799 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:11:59,807 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:11:59,855 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i[30494,30507] [2024-02-19 14:11:59,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:11:59,892 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:11:59,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59 WrapperNode [2024-02-19 14:11:59,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:11:59,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:11:59,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:11:59,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:11:59,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,940 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-02-19 14:11:59,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:11:59,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:11:59,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:11:59,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:11:59,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,969 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-02-19 14:11:59,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:11:59,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:11:59,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:11:59,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:11:59,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:11:59,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (1/1) ... [2024-02-19 14:12:00,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:12:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:12:00,038 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-02-19 14:12:00,047 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-02-19 14:12:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-19 14:12:00,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:12:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:12:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:12:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:12:00,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:12:00,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:12:00,087 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:12:00,173 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:12:00,175 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:12:00,292 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:12:00,293 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:12:00,327 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:12:00,328 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-19 14:12:00,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:12:00 BoogieIcfgContainer [2024-02-19 14:12:00,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:12:00,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:12:00,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:12:00,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:12:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:11:59" (1/3) ... [2024-02-19 14:12:00,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74242baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:12:00, skipping insertion in model container [2024-02-19 14:12:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:59" (2/3) ... [2024-02-19 14:12:00,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74242baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:12:00, skipping insertion in model container [2024-02-19 14:12:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:12:00" (3/3) ... [2024-02-19 14:12:00,358 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2024-02-19 14:12:00,371 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:12:00,372 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:12:00,372 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:12:00,392 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:00,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2024-02-19 14:12:00,432 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2024-02-19 14:12:00,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:12:00,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-19 14:12:00,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2024-02-19 14:12:00,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2024-02-19 14:12:00,444 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:00,449 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:00,450 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:12:00,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:00,453 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:00,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:12:00,453 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:00,454 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-02-19 14:12:00,454 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-02-19 14:12:00,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash 106924488, now seen corresponding path program 1 times [2024-02-19 14:12:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683445862] [2024-02-19 14:12:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:00,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:00,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:00,606 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:00,607 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-02-19 14:12:00,609 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-02-19 14:12:00,609 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-02-19 14:12:00,610 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:12:00,611 INFO L457 BasicCegarLoop]: Path program histogram: [1] [2024-02-19 14:12:00,616 WARN L345 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:00,616 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-02-19 14:12:00,643 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:00,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2024-02-19 14:12:00,654 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-02-19 14:12:00,655 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:12:00,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-02-19 14:12:00,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2024-02-19 14:12:00,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2024-02-19 14:12:00,656 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:00,657 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:00,657 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:12:00,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:00,660 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:00,660 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:00,660 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:00,660 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:00,660 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-19 14:12:00,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 124108086, now seen corresponding path program 1 times [2024-02-19 14:12:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:00,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406902662] [2024-02-19 14:12:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406902662] [2024-02-19 14:12:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406902662] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:00,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713236666] [2024-02-19 14:12:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:00,812 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:00,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 18 [2024-02-19 14:12:00,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-02-19 14:12:00,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:00,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 18 [2024-02-19 14:12:00,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:00,947 INFO L124 PetriNetUnfolderBase]: 47/107 cut-off events. [2024-02-19 14:12:00,947 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-19 14:12:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 107 events. 47/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 367 event pairs, 15 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 111. Up to 77 conditions per place. [2024-02-19 14:12:00,953 INFO L140 encePairwiseOnDemand]: 12/18 looper letters, 15 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2024-02-19 14:12:00,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 97 flow [2024-02-19 14:12:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-02-19 14:12:00,963 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-02-19 14:12:00,968 INFO L308 CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places. [2024-02-19 14:12:00,968 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 97 flow [2024-02-19 14:12:00,968 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-02-19 14:12:00,968 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:00,969 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-02-19 14:12:00,969 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:12:00,969 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-19 14:12:00,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash -991531367, now seen corresponding path program 1 times [2024-02-19 14:12:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325231417] [2024-02-19 14:12:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:00,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:00,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:00,992 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:00,992 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-02-19 14:12:00,992 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-02-19 14:12:00,992 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-02-19 14:12:00,993 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-02-19 14:12:00,993 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:12:00,993 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:12:00,994 WARN L345 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:00,994 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-02-19 14:12:01,004 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:01,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2024-02-19 14:12:01,010 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-02-19 14:12:01,011 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-19 14:12:01,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-02-19 14:12:01,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2024-02-19 14:12:01,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2024-02-19 14:12:01,013 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:01,014 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:01,014 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:12:01,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:01,017 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-02-19 14:12:01,017 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:01,017 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,017 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:01,017 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:12:01,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 147971477, now seen corresponding path program 1 times [2024-02-19 14:12:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110940705] [2024-02-19 14:12:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110940705] [2024-02-19 14:12:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110940705] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706983457] [2024-02-19 14:12:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:01,060 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:01,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:01,064 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2024-02-19 14:12:01,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-19 14:12:01,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:01,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2024-02-19 14:12:01,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:01,236 INFO L124 PetriNetUnfolderBase]: 447/731 cut-off events. [2024-02-19 14:12:01,237 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-02-19 14:12:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 731 events. 447/731 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3375 event pairs, 161 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 464. Up to 653 conditions per place. [2024-02-19 14:12:01,244 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2024-02-19 14:12:01,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 148 flow [2024-02-19 14:12:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-02-19 14:12:01,246 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2024-02-19 14:12:01,247 INFO L308 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-02-19 14:12:01,247 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 148 flow [2024-02-19 14:12:01,247 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-19 14:12:01,247 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,248 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-02-19 14:12:01,248 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:12:01,248 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:12:01,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1492942590, now seen corresponding path program 1 times [2024-02-19 14:12:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164834051] [2024-02-19 14:12:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:01,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:01,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:01,300 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:01,300 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-02-19 14:12:01,300 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-02-19 14:12:01,301 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-02-19 14:12:01,301 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-02-19 14:12:01,301 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-02-19 14:12:01,301 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:12:01,301 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:12:01,303 WARN L345 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:01,303 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-02-19 14:12:01,321 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:01,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-02-19 14:12:01,327 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2024-02-19 14:12:01,328 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:12:01,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-02-19 14:12:01,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-02-19 14:12:01,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2024-02-19 14:12:01,331 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:01,333 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:01,333 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-19 14:12:01,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:01,336 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:01,336 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:01,336 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,337 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:01,337 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:12:01,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 178515195, now seen corresponding path program 1 times [2024-02-19 14:12:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330655570] [2024-02-19 14:12:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330655570] [2024-02-19 14:12:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330655570] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:01,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:01,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441134895] [2024-02-19 14:12:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:01,395 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:01,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:01,410 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-02-19 14:12:01,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-02-19 14:12:01,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:01,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-02-19 14:12:01,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:01,819 INFO L124 PetriNetUnfolderBase]: 3473/4901 cut-off events. [2024-02-19 14:12:01,819 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2024-02-19 14:12:01,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 4901 events. 3473/4901 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 25251 event pairs, 1433 based on Foata normal form. 0/3983 useless extension candidates. Maximal degree in co-relation 1769. Up to 4711 conditions per place. [2024-02-19 14:12:01,849 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2024-02-19 14:12:01,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 203 flow [2024-02-19 14:12:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-02-19 14:12:01,851 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2024-02-19 14:12:01,852 INFO L308 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-02-19 14:12:01,852 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 203 flow [2024-02-19 14:12:01,852 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-02-19 14:12:01,852 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,852 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:01,853 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:12:01,853 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:12:01,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1121575831, now seen corresponding path program 1 times [2024-02-19 14:12:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645730453] [2024-02-19 14:12:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:01,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:01,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:01,873 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-02-19 14:12:01,874 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-02-19 14:12:01,875 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:12:01,875 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:12:01,875 WARN L345 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:01,875 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-02-19 14:12:01,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:01,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2024-02-19 14:12:01,925 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-02-19 14:12:01,925 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-19 14:12:01,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-02-19 14:12:01,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2024-02-19 14:12:01,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2024-02-19 14:12:01,927 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:01,928 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:01,928 INFO L370 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-02-19 14:12:01,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:01,929 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:01,929 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:01,929 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,929 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:01,930 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-02-19 14:12:01,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 215738664, now seen corresponding path program 1 times [2024-02-19 14:12:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569157189] [2024-02-19 14:12:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569157189] [2024-02-19 14:12:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569157189] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372026241] [2024-02-19 14:12:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:01,959 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:01,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:01,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:01,971 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-02-19 14:12:01,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-19 14:12:01,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:01,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-02-19 14:12:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:04,089 INFO L124 PetriNetUnfolderBase]: 24009/31313 cut-off events. [2024-02-19 14:12:04,089 INFO L125 PetriNetUnfolderBase]: For 9784/9784 co-relation queries the response was YES. [2024-02-19 14:12:04,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66523 conditions, 31313 events. 24009/31313 cut-off events. For 9784/9784 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169897 event pairs, 11031 based on Foata normal form. 0/24923 useless extension candidates. Maximal degree in co-relation 10509. Up to 30867 conditions per place. [2024-02-19 14:12:04,332 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 36 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2024-02-19 14:12:04,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 262 flow [2024-02-19 14:12:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-02-19 14:12:04,334 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2024-02-19 14:12:04,334 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2024-02-19 14:12:04,335 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 262 flow [2024-02-19 14:12:04,335 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-19 14:12:04,335 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:04,335 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:04,335 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:12:04,336 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-02-19 14:12:04,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 517469200, now seen corresponding path program 1 times [2024-02-19 14:12:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538732499] [2024-02-19 14:12:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:12:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538732499] [2024-02-19 14:12:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538732499] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:04,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:12:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393706403] [2024-02-19 14:12:04,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:04,364 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:04,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:04,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:04,368 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-02-19 14:12:04,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-19 14:12:04,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:04,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-02-19 14:12:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:06,445 INFO L124 PetriNetUnfolderBase]: 26438/34358 cut-off events. [2024-02-19 14:12:06,446 INFO L125 PetriNetUnfolderBase]: For 27477/28505 co-relation queries the response was YES. [2024-02-19 14:12:06,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95944 conditions, 34358 events. 26438/34358 cut-off events. For 27477/28505 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 186957 event pairs, 8469 based on Foata normal form. 0/32364 useless extension candidates. Maximal degree in co-relation 25255. Up to 27870 conditions per place. [2024-02-19 14:12:06,803 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 42 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-02-19 14:12:06,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 418 flow [2024-02-19 14:12:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-02-19 14:12:06,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2024-02-19 14:12:06,807 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-02-19 14:12:06,807 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 63 transitions, 418 flow [2024-02-19 14:12:06,807 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-19 14:12:06,807 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:06,807 INFO L234 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:06,808 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:12:06,808 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-02-19 14:12:06,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1312859396, now seen corresponding path program 1 times [2024-02-19 14:12:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004404382] [2024-02-19 14:12:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:06,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:06,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:06,840 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:06,840 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-02-19 14:12:06,840 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-02-19 14:12:06,840 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-02-19 14:12:06,840 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-02-19 14:12:06,841 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-02-19 14:12:06,841 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-02-19 14:12:06,841 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-02-19 14:12:06,841 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:12:06,841 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-02-19 14:12:06,842 WARN L345 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:06,842 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-02-19 14:12:06,857 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2024-02-19 14:12:06,862 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2024-02-19 14:12:06,863 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-02-19 14:12:06,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 148 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2024-02-19 14:12:06,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2024-02-19 14:12:06,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2024-02-19 14:12:06,866 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:06,866 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:06,868 INFO L370 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-02-19 14:12:06,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:06,870 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:06,870 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:06,870 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:06,870 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:06,871 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:12:06,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash 259642460, now seen corresponding path program 1 times [2024-02-19 14:12:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495827951] [2024-02-19 14:12:06,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:06,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495827951] [2024-02-19 14:12:06,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495827951] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:06,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:06,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675953792] [2024-02-19 14:12:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:06,902 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:06,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:06,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:06,916 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:12:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-02-19 14:12:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:12:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:17,980 INFO L124 PetriNetUnfolderBase]: 153983/191303 cut-off events. [2024-02-19 14:12:17,980 INFO L125 PetriNetUnfolderBase]: For 71426/71426 co-relation queries the response was YES. [2024-02-19 14:12:18,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406806 conditions, 191303 events. 153983/191303 cut-off events. For 71426/71426 co-relation queries the response was YES. Maximal size of possible extension queue 6618. Compared 1068829 event pairs, 76663 based on Foata normal form. 0/150265 useless extension candidates. Maximal degree in co-relation 67205. Up to 190281 conditions per place. [2024-02-19 14:12:19,805 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 43 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-02-19 14:12:19,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 325 flow [2024-02-19 14:12:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-02-19 14:12:19,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2024-02-19 14:12:19,809 INFO L308 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2024-02-19 14:12:19,809 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 325 flow [2024-02-19 14:12:19,810 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-02-19 14:12:19,810 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:19,810 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:19,810 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:12:19,810 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:12:19,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1615788618, now seen corresponding path program 1 times [2024-02-19 14:12:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861941070] [2024-02-19 14:12:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:12:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:19,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861941070] [2024-02-19 14:12:19,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861941070] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:19,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:12:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28835472] [2024-02-19 14:12:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:19,864 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:19,872 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-02-19 14:12:19,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-02-19 14:12:19,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:19,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-02-19 14:12:19,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:31,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L718-5-->L718-4: Formula: (and (= (store |v_#memory_int#1_4| |v_ULTIMATE.start_main_~#t~0#1.base_27| (store (select |v_#memory_int#1_4| |v_ULTIMATE.start_main_~#t~0#1.base_27|) |v_ULTIMATE.start_main_~#t~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre4#1_17|)) |v_#memory_int#1_3|) (= |v_#pthreadsForks_10| (+ |v_#pthreadsForks_11| 1)) (= |v_#pthreadsForks_11| |v_ULTIMATE.start_main_#t~pre4#1_17|)) InVars {#pthreadsForks=|v_#pthreadsForks_11|, #memory_int#1=|v_#memory_int#1_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_27|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_23|} OutVars{#pthreadsForks=|v_#pthreadsForks_10|, #memory_int#1=|v_#memory_int#1_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_17|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_27|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_23|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int#1, ULTIMATE.start_main_#t~pre4#1][15], [42#L718-4true, 6#L709true, 62#true, 5#L709true, 25#L712true, thr1Thread1of6ForFork0InUse, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 28#L712true, 67#(= ~s~0 1), thr1Thread4of6ForFork0InUse, 22#L709true, thr1Thread5of6ForFork0InUse, 48#L712true, thr1Thread6of6ForFork0InUse]) [2024-02-19 14:12:31,174 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,174 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,174 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,174 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([277] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread3of6ForFork0_#res.offset_1| 0) (= |v_thr1Thread3of6ForFork0_#res.base_1| 0)) InVars {} OutVars{thr1Thread3of6ForFork0_#res.offset=|v_thr1Thread3of6ForFork0_#res.offset_1|, thr1Thread3of6ForFork0_#res.base=|v_thr1Thread3of6ForFork0_#res.base_1|} AuxVars[] AssignedVars[thr1Thread3of6ForFork0_#res.base, thr1Thread3of6ForFork0_#res.offset][40], [24#thr1EXITtrue, 6#L709true, 62#true, 5#L709true, 25#L712true, thr1Thread1of6ForFork0InUse, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 67#(= ~s~0 1), thr1Thread4of6ForFork0InUse, 22#L709true, thr1Thread5of6ForFork0InUse, 45#L718-5true, 48#L712true, thr1Thread6of6ForFork0InUse]) [2024-02-19 14:12:31,174 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([283] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread2of6ForFork0_#res.base_1| 0) (= |v_thr1Thread2of6ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr1Thread2of6ForFork0_#res.base=|v_thr1Thread2of6ForFork0_#res.base_1|, thr1Thread2of6ForFork0_#res.offset=|v_thr1Thread2of6ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr1Thread2of6ForFork0_#res.base, thr1Thread2of6ForFork0_#res.offset][28], [6#L709true, 62#true, 5#L709true, 25#L712true, thr1Thread1of6ForFork0InUse, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 28#L712true, thr1Thread4of6ForFork0InUse, 67#(= ~s~0 1), 7#thr1EXITtrue, 22#L709true, thr1Thread5of6ForFork0InUse, 45#L718-5true, thr1Thread6of6ForFork0InUse]) [2024-02-19 14:12:31,175 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,175 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,176 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread1of6ForFork0_#res.offset_1| 0) (= 0 |v_thr1Thread1of6ForFork0_#res.base_1|)) InVars {} OutVars{thr1Thread1of6ForFork0_#res.base=|v_thr1Thread1of6ForFork0_#res.base_1|, thr1Thread1of6ForFork0_#res.offset=|v_thr1Thread1of6ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr1Thread1of6ForFork0_#res.offset, thr1Thread1of6ForFork0_#res.base][16], [6#L709true, 62#true, 5#L709true, thr1Thread1of6ForFork0InUse, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 28#L712true, thr1Thread4of6ForFork0InUse, 67#(= ~s~0 1), 22#L709true, thr1Thread5of6ForFork0InUse, 45#L718-5true, 48#L712true, thr1Thread6of6ForFork0InUse, 23#thr1EXITtrue]) [2024-02-19 14:12:31,176 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,176 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,176 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,176 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-02-19 14:12:31,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([277] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread3of6ForFork0_#res.offset_1| 0) (= |v_thr1Thread3of6ForFork0_#res.base_1| 0)) InVars {} OutVars{thr1Thread3of6ForFork0_#res.offset=|v_thr1Thread3of6ForFork0_#res.offset_1|, thr1Thread3of6ForFork0_#res.base=|v_thr1Thread3of6ForFork0_#res.base_1|} AuxVars[] AssignedVars[thr1Thread3of6ForFork0_#res.base, thr1Thread3of6ForFork0_#res.offset][40], [42#L718-4true, 24#thr1EXITtrue, 6#L709true, 62#true, 5#L709true, thr1Thread1of6ForFork0InUse, 25#L712true, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 67#(= ~s~0 1), thr1Thread4of6ForFork0InUse, 22#L709true, thr1Thread5of6ForFork0InUse, 48#L712true, thr1Thread6of6ForFork0InUse]) [2024-02-19 14:12:31,876 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,876 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,876 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,876 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([283] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread2of6ForFork0_#res.base_1| 0) (= |v_thr1Thread2of6ForFork0_#res.offset_1| 0)) InVars {} OutVars{thr1Thread2of6ForFork0_#res.base=|v_thr1Thread2of6ForFork0_#res.base_1|, thr1Thread2of6ForFork0_#res.offset=|v_thr1Thread2of6ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr1Thread2of6ForFork0_#res.base, thr1Thread2of6ForFork0_#res.offset][28], [42#L718-4true, 6#L709true, 62#true, 5#L709true, thr1Thread1of6ForFork0InUse, 25#L712true, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, 67#(= ~s~0 1), thr1Thread4of6ForFork0InUse, 28#L712true, 7#thr1EXITtrue, 22#L709true, thr1Thread5of6ForFork0InUse, thr1Thread6of6ForFork0InUse]) [2024-02-19 14:12:31,877 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L712-->thr1EXIT: Formula: (and (= |v_thr1Thread1of6ForFork0_#res.offset_1| 0) (= 0 |v_thr1Thread1of6ForFork0_#res.base_1|)) InVars {} OutVars{thr1Thread1of6ForFork0_#res.base=|v_thr1Thread1of6ForFork0_#res.base_1|, thr1Thread1of6ForFork0_#res.offset=|v_thr1Thread1of6ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thr1Thread1of6ForFork0_#res.offset, thr1Thread1of6ForFork0_#res.base][16], [42#L718-4true, 6#L709true, 62#true, 5#L709true, thr1Thread1of6ForFork0InUse, thr1Thread2of6ForFork0InUse, thr1Thread3of6ForFork0InUse, thr1Thread4of6ForFork0InUse, 67#(= ~s~0 1), 28#L712true, 22#L709true, thr1Thread5of6ForFork0InUse, 48#L712true, thr1Thread6of6ForFork0InUse, 23#thr1EXITtrue]) [2024-02-19 14:12:31,877 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,877 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:31,878 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-02-19 14:12:33,228 INFO L124 PetriNetUnfolderBase]: 164045/203453 cut-off events. [2024-02-19 14:12:33,230 INFO L125 PetriNetUnfolderBase]: For 182107/189528 co-relation queries the response was YES. [2024-02-19 14:12:33,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569078 conditions, 203453 events. 164045/203453 cut-off events. For 182107/189528 co-relation queries the response was YES. Maximal size of possible extension queue 6672. Compared 1153664 event pairs, 60202 based on Foata normal form. 0/187788 useless extension candidates. Maximal degree in co-relation 118558. Up to 169801 conditions per place. [2024-02-19 14:12:34,676 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 50 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-02-19 14:12:34,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 518 flow [2024-02-19 14:12:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-02-19 14:12:34,679 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2024-02-19 14:12:34,680 INFO L308 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2024-02-19 14:12:34,680 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 518 flow [2024-02-19 14:12:34,681 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-02-19 14:12:34,682 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:34,682 INFO L234 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:34,682 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 14:12:34,682 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-02-19 14:12:34,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1286908901, now seen corresponding path program 1 times [2024-02-19 14:12:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:34,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235812286] [2024-02-19 14:12:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:34,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:34,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:34,719 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:34,719 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-02-19 14:12:34,719 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-02-19 14:12:34,720 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-02-19 14:12:34,721 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:12:34,721 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-02-19 14:12:34,721 WARN L345 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:34,721 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-02-19 14:12:34,737 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:34,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2024-02-19 14:12:34,741 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2024-02-19 14:12:34,741 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-02-19 14:12:34,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 184 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-02-19 14:12:34,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2024-02-19 14:12:34,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2024-02-19 14:12:34,743 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:34,743 INFO L369 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=All, 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;@21219e62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:34,743 INFO L370 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-02-19 14:12:34,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:34,744 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:12:34,744 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:34,744 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:34,744 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-19 14:12:34,744 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2024-02-19 14:12:34,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 310226967, now seen corresponding path program 1 times [2024-02-19 14:12:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:34,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268584924] [2024-02-19 14:12:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:12:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268584924] [2024-02-19 14:12:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268584924] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:34,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-19 14:12:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329144469] [2024-02-19 14:12:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:34,774 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:34,780 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-02-19 14:12:34,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-02-19 14:12:34,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:34,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-02-19 14:12:34,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand