./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_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/45_monabsex1_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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --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:48,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:11:48,795 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:48,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:11:48,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:11:48,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:11:48,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:11:48,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:11:48,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:11:48,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:11:48,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:11:48,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:11:48,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:11:48,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:11:48,819 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:11:48,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:11:48,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:11:48,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:11:48,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:11:48,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:11:48,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:11:48,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:11:48,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:11:48,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:11:48,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:11:48,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:11:48,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:11:48,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:11:48,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:11:48,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:11:48,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:11:48,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:11:48,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:11:48,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:11:48,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:11:48,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:11:48,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:11:48,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:11:48,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:11:48,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:11:48,828 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:11:48,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:11:48,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:11:48,829 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 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:49,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:11:49,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:11:49,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:11:49,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:11:49,140 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:11:49,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2024-02-19 14:11:50,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:11:50,382 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:11:50,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2024-02-19 14:11:50,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/051b3bd6b/4a96453580574088adad921c31a27e90/FLAGb57a28649 [2024-02-19 14:11:50,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/051b3bd6b/4a96453580574088adad921c31a27e90 [2024-02-19 14:11:50,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:11:50,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:11:50,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:11:50,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:11:50,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:11:50,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:11:50" (1/1) ... [2024-02-19 14:11:50,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d76d08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:50, skipping insertion in model container [2024-02-19 14:11:50,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:11:50" (1/1) ... [2024-02-19 14:11:50,472 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:11:50,739 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/45_monabsex1_vs.i[30633,30646] [2024-02-19 14:11:50,749 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:11:50,756 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:11:50,795 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/45_monabsex1_vs.i[30633,30646] [2024-02-19 14:11:50,798 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:11:50,830 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:11:50,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:50 WrapperNode [2024-02-19 14:11:50,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:11:50,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:11:50,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:11:50,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:11:50,837 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:50" (1/1) ... [2024-02-19 14:11:50,863 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:50" (1/1) ... [2024-02-19 14:11:50,876 INFO L138 Inliner]: procedures = 170, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-19 14:11:50,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:11:50,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:11:50,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:11:50,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:11:50,884 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:50" (1/1) ... [2024-02-19 14:11:50,884 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:50" (1/1) ... [2024-02-19 14:11:50,888 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:50" (1/1) ... [2024-02-19 14:11:50,903 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:50,904 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:50" (1/1) ... [2024-02-19 14:11:50,904 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:50" (1/1) ... [2024-02-19 14:11:50,917 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:50" (1/1) ... [2024-02-19 14:11:50,920 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:50" (1/1) ... [2024-02-19 14:11:50,927 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:50" (1/1) ... [2024-02-19 14:11:50,928 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:50" (1/1) ... [2024-02-19 14:11:50,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:11:50,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:11:50,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:11:50,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:11:50,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:50" (1/1) ... [2024-02-19 14:11:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:11:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:11:50,974 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:11:51,004 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:11:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-19 14:11:51,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-19 14:11:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:11:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:11:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:11:51,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:11:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:11:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:11:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:11:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:11:51,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:11:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:11:51,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:11:51,035 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:11:51,172 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:11:51,174 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:11:51,287 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:11:51,288 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:11:51,345 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:11:51,345 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-19 14:11:51,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:11:51 BoogieIcfgContainer [2024-02-19 14:11:51,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:11:51,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:11:51,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:11:51,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:11:51,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:11:50" (1/3) ... [2024-02-19 14:11:51,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b665278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:11:51, skipping insertion in model container [2024-02-19 14:11:51,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:11:50" (2/3) ... [2024-02-19 14:11:51,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b665278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:11:51, skipping insertion in model container [2024-02-19 14:11:51,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:11:51" (3/3) ... [2024-02-19 14:11:51,351 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2024-02-19 14:11:51,365 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:11:51,366 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:11:51,366 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:11:51,398 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:11:51,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2024-02-19 14:11:51,437 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-02-19 14:11:51,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:11:51,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-19 14:11:51,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2024-02-19 14:11:51,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2024-02-19 14:11:51,447 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:11:51,452 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;@56b62752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:11:51,452 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:11:51,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:11:51,455 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-02-19 14:11:51,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:11:51,455 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:51,456 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-02-19 14:11:51,456 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:11:51,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash 122190482, now seen corresponding path program 1 times [2024-02-19 14:11:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:51,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144476255] [2024-02-19 14:11:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:51,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:11:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:51,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:11:51,636 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:11:51,637 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-02-19 14:11:51,639 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-02-19 14:11:51,640 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-02-19 14:11:51,640 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:11:51,641 INFO L457 BasicCegarLoop]: Path program histogram: [1] [2024-02-19 14:11:51,647 WARN L345 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:11:51,648 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-02-19 14:11:51,663 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:11:51,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2024-02-19 14:11:51,671 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-02-19 14:11:51,671 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:11:51,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-02-19 14:11:51,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2024-02-19 14:11:51,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2024-02-19 14:11:51,673 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:11:51,673 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;@56b62752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:11:51,674 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:11:51,677 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:11:51,677 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-19 14:11:51,677 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:11:51,677 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:51,677 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:11:51,677 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:11:51,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash -33570275, now seen corresponding path program 1 times [2024-02-19 14:11:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031531921] [2024-02-19 14:11:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:51,770 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:11:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031531921] [2024-02-19 14:11:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031531921] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247260351] [2024-02-19 14:11:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:51,777 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:51,811 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2024-02-19 14:11:51,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:51,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:51,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2024-02-19 14:11:51,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:51,884 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2024-02-19 14:11:51,885 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-02-19 14:11:51,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 798 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 328. Up to 116 conditions per place. [2024-02-19 14:11:51,889 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2024-02-19 14:11:51,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2024-02-19 14:11:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2024-02-19 14:11:51,898 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-02-19 14:11:51,902 INFO L308 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-02-19 14:11:51,902 INFO L507 AbstractCegarLoop]: Abstraction has has 22 places, 24 transitions, 109 flow [2024-02-19 14:11:51,903 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:51,903 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:51,903 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-02-19 14:11:51,903 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:11:51,904 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:11:51,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1040911269, now seen corresponding path program 1 times [2024-02-19 14:11:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105684498] [2024-02-19 14:11:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:51,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:11:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:51,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:11:51,967 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:11:51,968 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-02-19 14:11:51,968 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-02-19 14:11:51,968 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-02-19 14:11:51,968 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-02-19 14:11:51,968 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:11:51,968 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:11:51,969 WARN L345 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:11:51,969 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-02-19 14:11:51,986 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:11:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2024-02-19 14:11:51,991 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-02-19 14:11:51,991 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-19 14:11:51,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-02-19 14:11:51,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2024-02-19 14:11:51,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2024-02-19 14:11:51,992 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:11:51,993 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;@56b62752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:11:51,993 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:11:51,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:11:51,995 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-02-19 14:11:51,995 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:11:51,995 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:51,995 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:11:51,995 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:11:51,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 617414712, now seen corresponding path program 1 times [2024-02-19 14:11:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697960921] [2024-02-19 14:11:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:52,032 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:11:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697960921] [2024-02-19 14:11:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697960921] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912458093] [2024-02-19 14:11:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:52,033 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:52,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-02-19 14:11:52,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:52,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:52,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-02-19 14:11:52,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:52,278 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2024-02-19 14:11:52,279 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2024-02-19 14:11:52,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2070 events. 1343/2070 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10031 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2280. Up to 1272 conditions per place. [2024-02-19 14:11:52,294 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-02-19 14:11:52,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2024-02-19 14:11:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-02-19 14:11:52,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-02-19 14:11:52,296 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-02-19 14:11:52,296 INFO L507 AbstractCegarLoop]: Abstraction has has 30 places, 36 transitions, 172 flow [2024-02-19 14:11:52,296 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:52,297 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:52,297 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-02-19 14:11:52,297 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:11:52,297 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:11:52,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 622998633, now seen corresponding path program 1 times [2024-02-19 14:11:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527943665] [2024-02-19 14:11:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:52,339 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:11:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527943665] [2024-02-19 14:11:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527943665] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819330071] [2024-02-19 14:11:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:52,341 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:52,344 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-02-19 14:11:52,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 36 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:11:52,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:52,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-02-19 14:11:52,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:52,542 INFO L124 PetriNetUnfolderBase]: 1689/2633 cut-off events. [2024-02-19 14:11:52,543 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2024-02-19 14:11:52,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 2633 events. 1689/2633 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13709 event pairs, 371 based on Foata normal form. 0/2293 useless extension candidates. Maximal degree in co-relation 5520. Up to 1546 conditions per place. [2024-02-19 14:11:52,556 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 53 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-02-19 14:11:52,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 61 transitions, 406 flow [2024-02-19 14:11:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-02-19 14:11:52,558 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-02-19 14:11:52,559 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-02-19 14:11:52,559 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 61 transitions, 406 flow [2024-02-19 14:11:52,560 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:11:52,560 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:52,560 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-02-19 14:11:52,560 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:11:52,560 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:11:52,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2132707573, now seen corresponding path program 1 times [2024-02-19 14:11:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991028656] [2024-02-19 14:11:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:52,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:11:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:11:52,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:11:52,598 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:11:52,598 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-02-19 14:11:52,598 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-02-19 14:11:52,598 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-02-19 14:11:52,598 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-02-19 14:11:52,599 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-02-19 14:11:52,599 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:11:52,599 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-02-19 14:11:52,599 WARN L345 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:11:52,600 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-02-19 14:11:52,612 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:11:52,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2024-02-19 14:11:52,617 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-02-19 14:11:52,617 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:11:52,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 0/36 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-02-19 14:11:52,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2024-02-19 14:11:52,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2024-02-19 14:11:52,619 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:11:52,619 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;@56b62752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:11:52,620 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-19 14:11:52,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:11:52,621 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-19 14:11:52,621 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:11:52,621 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:52,622 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:11:52,622 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:11:52,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1445905400, now seen corresponding path program 1 times [2024-02-19 14:11:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720660528] [2024-02-19 14:11:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:52,641 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:11:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720660528] [2024-02-19 14:11:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720660528] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113627441] [2024-02-19 14:11:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:52,643 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:52,648 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-02-19 14:11:52,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:52,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:52,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-02-19 14:11:52,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:53,638 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2024-02-19 14:11:53,638 INFO L125 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2024-02-19 14:11:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35374 conditions, 16840 events. 12243/16840 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90142 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 5360. Up to 10936 conditions per place. [2024-02-19 14:11:53,747 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-02-19 14:11:53,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2024-02-19 14:11:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-02-19 14:11:53,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2024-02-19 14:11:53,752 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-02-19 14:11:53,752 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 48 transitions, 239 flow [2024-02-19 14:11:53,752 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:11:53,752 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:53,753 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-02-19 14:11:53,753 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:11:53,753 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:11:53,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2065983804, now seen corresponding path program 1 times [2024-02-19 14:11:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328621499] [2024-02-19 14:11:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:53,788 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:11:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:53,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328621499] [2024-02-19 14:11:53,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328621499] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:53,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:53,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805099597] [2024-02-19 14:11:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:53,790 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:53,794 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-02-19 14:11:53,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 48 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:11:53,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:53,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-02-19 14:11:53,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:55,177 INFO L124 PetriNetUnfolderBase]: 16953/23429 cut-off events. [2024-02-19 14:11:55,177 INFO L125 PetriNetUnfolderBase]: For 4631/4631 co-relation queries the response was YES. [2024-02-19 14:11:55,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72519 conditions, 23429 events. 16953/23429 cut-off events. For 4631/4631 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 135303 event pairs, 4763 based on Foata normal form. 0/19969 useless extension candidates. Maximal degree in co-relation 25440. Up to 15062 conditions per place. [2024-02-19 14:11:55,310 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 75 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2024-02-19 14:11:55,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 85 transitions, 587 flow [2024-02-19 14:11:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-02-19 14:11:55,313 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-19 14:11:55,316 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2024-02-19 14:11:55,316 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 85 transitions, 587 flow [2024-02-19 14:11:55,316 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:11:55,316 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:55,317 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:11:55,317 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:11:55,317 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:11:55,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1151970661, now seen corresponding path program 1 times [2024-02-19 14:11:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171538534] [2024-02-19 14:11:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:11:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171538534] [2024-02-19 14:11:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171538534] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:55,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:11:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139908491] [2024-02-19 14:11:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:55,362 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:11:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:11:55,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:11:55,367 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-02-19 14:11:55,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 85 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:11:55,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:55,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-02-19 14:11:55,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:11:57,066 INFO L124 PetriNetUnfolderBase]: 22305/31029 cut-off events. [2024-02-19 14:11:57,066 INFO L125 PetriNetUnfolderBase]: For 5287/5287 co-relation queries the response was YES. [2024-02-19 14:11:57,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126789 conditions, 31029 events. 22305/31029 cut-off events. For 5287/5287 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 187319 event pairs, 3007 based on Foata normal form. 0/26897 useless extension candidates. Maximal degree in co-relation 76048. Up to 19502 conditions per place. [2024-02-19 14:11:57,296 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 132 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-02-19 14:11:57,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 149 transitions, 1303 flow [2024-02-19 14:11:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:11:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:11:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-02-19 14:11:57,299 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-19 14:11:57,300 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-02-19 14:11:57,300 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 149 transitions, 1303 flow [2024-02-19 14:11:57,301 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:11:57,301 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:11:57,301 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:11:57,301 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:11:57,301 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:11:57,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:11:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1472659730, now seen corresponding path program 1 times [2024-02-19 14:11:57,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:11:57,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932274346] [2024-02-19 14:11:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:11:57,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:11:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:11:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:11:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:11:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932274346] [2024-02-19 14:11:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932274346] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:11:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:11:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:11:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424682695] [2024-02-19 14:11:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:11:57,379 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:11:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:11:57,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:11:57,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:11:57,401 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-02-19 14:11:57,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 149 transitions, 1303 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:11:57,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:11:57,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-02-19 14:11:57,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:00,795 INFO L124 PetriNetUnfolderBase]: 38199/53539 cut-off events. [2024-02-19 14:12:00,796 INFO L125 PetriNetUnfolderBase]: For 9230/9230 co-relation queries the response was YES. [2024-02-19 14:12:00,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272386 conditions, 53539 events. 38199/53539 cut-off events. For 9230/9230 co-relation queries the response was YES. Maximal size of possible extension queue 2364. Compared 354062 event pairs, 2185 based on Foata normal form. 0/46729 useless extension candidates. Maximal degree in co-relation 121120. Up to 33702 conditions per place. [2024-02-19 14:12:01,244 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 292 selfloop transitions, 45 changer transitions 0/338 dead transitions. [2024-02-19 14:12:01,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 338 transitions, 3644 flow [2024-02-19 14:12:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:12:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:12:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-02-19 14:12:01,247 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-02-19 14:12:01,248 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2024-02-19 14:12:01,248 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 338 transitions, 3644 flow [2024-02-19 14:12:01,249 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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,249 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:01,249 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:01,249 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:12:01,249 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:12:01,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1135723520, now seen corresponding path program 2 times [2024-02-19 14:12:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36554961] [2024-02-19 14:12:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:01,301 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:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36554961] [2024-02-19 14:12:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36554961] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:01,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:12:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121322721] [2024-02-19 14:12:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:01,305 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:12:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:12:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:12:01,311 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-02-19 14:12:01,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 338 transitions, 3644 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:01,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-02-19 14:12:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:05,833 INFO L124 PetriNetUnfolderBase]: 41715/58931 cut-off events. [2024-02-19 14:12:05,833 INFO L125 PetriNetUnfolderBase]: For 10088/10088 co-relation queries the response was YES. [2024-02-19 14:12:05,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358718 conditions, 58931 events. 41715/58931 cut-off events. For 10088/10088 co-relation queries the response was YES. Maximal size of possible extension queue 2588. Compared 401437 event pairs, 1885 based on Foata normal form. 0/52147 useless extension candidates. Maximal degree in co-relation 279720. Up to 36728 conditions per place. [2024-02-19 14:12:06,308 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 450 selfloop transitions, 65 changer transitions 0/516 dead transitions. [2024-02-19 14:12:06,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 516 transitions, 6597 flow [2024-02-19 14:12:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 14:12:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 14:12:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-02-19 14:12:06,309 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-02-19 14:12:06,310 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2024-02-19 14:12:06,310 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 516 transitions, 6597 flow [2024-02-19 14:12:06,310 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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,310 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:06,310 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:06,310 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:12:06,311 INFO L432 AbstractCegarLoop]: === Iteration 6 === 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:06,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1351419360, now seen corresponding path program 1 times [2024-02-19 14:12:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967111784] [2024-02-19 14:12:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:06,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:12:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:12:06,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:12:06,332 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:12:06,332 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-02-19 14:12:06,332 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-02-19 14:12:06,332 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-02-19 14:12:06,332 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-02-19 14:12:06,333 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-02-19 14:12:06,333 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-02-19 14:12:06,333 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 14:12:06,333 INFO L457 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-02-19 14:12:06,334 WARN L345 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:12:06,334 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-02-19 14:12:06,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:12:06,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2024-02-19 14:12:06,355 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2024-02-19 14:12:06,355 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-19 14:12:06,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 0/44 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2024-02-19 14:12:06,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2024-02-19 14:12:06,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2024-02-19 14:12:06,358 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:12:06,361 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;@56b62752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:12:06,361 INFO L370 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-02-19 14:12:06,363 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:12:06,363 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-19 14:12:06,363 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:12:06,363 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:06,363 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:12:06,364 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:06,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1843080402, now seen corresponding path program 1 times [2024-02-19 14:12:06,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:06,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464117678] [2024-02-19 14:12:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:06,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:06,376 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,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464117678] [2024-02-19 14:12:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464117678] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:12:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478582444] [2024-02-19 14:12:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:06,378 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:06,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:06,385 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-02-19 14:12:06,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:06,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-02-19 14:12:06,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:12,050 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2024-02-19 14:12:12,050 INFO L125 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2024-02-19 14:12:12,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264858 conditions, 126043 events. 97851/126043 cut-off events. For 36230/36230 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 716093 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 35315. Up to 84136 conditions per place. [2024-02-19 14:12:12,995 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-02-19 14:12:12,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2024-02-19 14:12:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-02-19 14:12:12,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-02-19 14:12:12,997 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2024-02-19 14:12:12,997 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 60 transitions, 310 flow [2024-02-19 14:12:12,997 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:12,997 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:12,997 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:12,997 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:12:12,997 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:12,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1680503157, now seen corresponding path program 1 times [2024-02-19 14:12:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:12,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149012147] [2024-02-19 14:12:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:12,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:13,024 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:13,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149012147] [2024-02-19 14:12:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149012147] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:12:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058849028] [2024-02-19 14:12:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:13,026 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:13,032 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-02-19 14:12:13,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 60 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:13,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:13,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-02-19 14:12:13,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:12:22,044 INFO L124 PetriNetUnfolderBase]: 140281/181086 cut-off events. [2024-02-19 14:12:22,044 INFO L125 PetriNetUnfolderBase]: For 48689/48689 co-relation queries the response was YES. [2024-02-19 14:12:22,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561441 conditions, 181086 events. 140281/181086 cut-off events. For 48689/48689 co-relation queries the response was YES. Maximal size of possible extension queue 5184. Compared 1093900 event pairs, 44523 based on Foata normal form. 0/152762 useless extension candidates. Maximal degree in co-relation 72480. Up to 121118 conditions per place. [2024-02-19 14:12:23,279 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 97 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2024-02-19 14:12:23,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 109 transitions, 776 flow [2024-02-19 14:12:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:12:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:12:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-02-19 14:12:23,281 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-02-19 14:12:23,281 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-02-19 14:12:23,281 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 109 transitions, 776 flow [2024-02-19 14:12:23,282 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:23,282 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:12:23,282 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:12:23,282 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 14:12:23,282 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-02-19 14:12:23,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:12:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -57782282, now seen corresponding path program 1 times [2024-02-19 14:12:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:12:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518507697] [2024-02-19 14:12:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:12:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:12:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:12:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 14:12:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:12:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518507697] [2024-02-19 14:12:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518507697] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:12:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:12:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:12:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639784374] [2024-02-19 14:12:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:12:23,307 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:12:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:12:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:12:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:12:23,312 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-02-19 14:12:23,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 109 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:23,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:12:23,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-02-19 14:12:23,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand