./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:09:41,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:09:41,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:09:41,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:09:41,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:09:41,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:09:41,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:09:41,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:09:41,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:09:41,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:09:41,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:09:41,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:09:41,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:09:41,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:09:41,603 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:09:41,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:09:41,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:09:41,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:09:41,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:09:41,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:09:41,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:09:41,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:09:41,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:09:41,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:09:41,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:09:41,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:09:41,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:09:41,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:09:41,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:09:41,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:09:41,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:09:41,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:09:41,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:09:41,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:09:41,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:09:41,608 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:09:41,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:09:41,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:09:41,608 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 [2024-01-27 15:09:41,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:09:41,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:09:41,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:09:41,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:09:41,868 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:09:41,869 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-01-27 15:09:42,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:09:43,094 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:09:43,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2024-01-27 15:09:43,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7abba872/291ecdf9eded43869b2cfd7f113cbefb/FLAGe8bcd3d76 [2024-01-27 15:09:43,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7abba872/291ecdf9eded43869b2cfd7f113cbefb [2024-01-27 15:09:43,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:09:43,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:09:43,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:09:43,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:09:43,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:09:43,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b8921a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43, skipping insertion in model container [2024-01-27 15:09:43,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:09:43,445 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-01-27 15:09:43,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:09:43,466 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:09:43,505 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-01-27 15:09:43,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:09:43,536 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:09:43,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43 WrapperNode [2024-01-27 15:09:43,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:09:43,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:09:43,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:09:43,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:09:43,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,581 INFO L138 Inliner]: procedures = 170, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-01-27 15:09:43,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:09:43,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:09:43,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:09:43,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:09:43,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,609 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-01-27 15:09:43,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:09:43,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:09:43,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:09:43,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:09:43,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (1/1) ... [2024-01-27 15:09:43,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:09:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:09:43,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:09:43,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:09:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-01-27 15:09:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-01-27 15:09:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:09:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:09:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:09:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:09:43,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:09:43,693 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:09:43,789 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:09:43,791 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:09:43,852 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:09:43,852 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:09:43,907 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:09:43,908 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-01-27 15:09:43,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:09:43 BoogieIcfgContainer [2024-01-27 15:09:43,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:09:43,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:09:43,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:09:43,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:09:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:09:43" (1/3) ... [2024-01-27 15:09:43,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c97d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:09:43, skipping insertion in model container [2024-01-27 15:09:43,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:09:43" (2/3) ... [2024-01-27 15:09:43,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c97d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:09:43, skipping insertion in model container [2024-01-27 15:09:43,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:09:43" (3/3) ... [2024-01-27 15:09:43,913 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2024-01-27 15:09:43,919 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:09:43,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:09:43,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:09:43,926 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:09:43,947 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:43,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2024-01-27 15:09:43,982 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-01-27 15:09:43,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 15:09:43,983 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-01-27 15:09:43,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2024-01-27 15:09:43,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2024-01-27 15:09:43,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:44,006 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3493d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:44,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:09:44,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:44,023 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-01-27 15:09:44,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 15:09:44,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-01-27 15:09:44,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-27 15:09:44,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 122190482, now seen corresponding path program 1 times [2024-01-27 15:09:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630875114] [2024-01-27 15:09:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:44,156 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:44,157 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-01-27 15:09:44,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-01-27 15:09:44,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-01-27 15:09:44,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:09:44,160 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-01-27 15:09:44,162 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:44,162 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-01-27 15:09:44,214 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:44,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2024-01-27 15:09:44,227 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2024-01-27 15:09:44,228 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:09:44,228 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-01-27 15:09:44,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2024-01-27 15:09:44,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2024-01-27 15:09:44,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:44,231 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3493d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:44,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:09:44,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:44,237 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-01-27 15:09:44,237 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:44,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 15:09:44,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-01-27 15:09:44,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -33570275, now seen corresponding path program 1 times [2024-01-27 15:09:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636613892] [2024-01-27 15:09:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636613892] [2024-01-27 15:09:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636613892] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:44,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582303933] [2024-01-27 15:09:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:44,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:44,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2024-01-27 15:09:44,410 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-01-27 15:09:44,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:44,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2024-01-27 15:09:44,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:44,482 INFO L124 PetriNetUnfolderBase]: 109/215 cut-off events. [2024-01-27 15:09:44,483 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:09:44,487 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-01-27 15:09:44,489 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2024-01-27 15:09:44,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2024-01-27 15:09:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2024-01-27 15:09:44,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-01-27 15:09:44,500 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 29 transitions. [2024-01-27 15:09:44,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 109 flow [2024-01-27 15:09:44,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:44,503 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 62 flow [2024-01-27 15:09:44,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2024-01-27 15:09:44,509 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2024-01-27 15:09:44,509 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 62 flow [2024-01-27 15:09:44,509 INFO L496 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-01-27 15:09:44,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,510 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2024-01-27 15:09:44,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:09:44,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-01-27 15:09:44,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1040911269, now seen corresponding path program 1 times [2024-01-27 15:09:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836768347] [2024-01-27 15:09:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:44,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:44,571 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:44,573 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-01-27 15:09:44,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-01-27 15:09:44,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-01-27 15:09:44,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-01-27 15:09:44,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:09:44,574 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-01-27 15:09:44,575 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:44,575 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-01-27 15:09:44,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:44,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2024-01-27 15:09:44,593 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-01-27 15:09:44,593 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 15:09:44,594 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-01-27 15:09:44,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2024-01-27 15:09:44,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2024-01-27 15:09:44,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:44,596 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3493d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:44,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:09:44,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:44,599 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2024-01-27 15:09:44,599 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:09:44,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 15:09:44,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-01-27 15:09:44,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 617414712, now seen corresponding path program 1 times [2024-01-27 15:09:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78377663] [2024-01-27 15:09:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78377663] [2024-01-27 15:09:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78377663] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130810089] [2024-01-27 15:09:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:44,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:44,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-01-27 15:09:44,654 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-01-27 15:09:44,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:44,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-01-27 15:09:44,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:44,892 INFO L124 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2024-01-27 15:09:44,893 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2024-01-27 15:09:44,897 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-01-27 15:09:44,905 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2024-01-27 15:09:44,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2024-01-27 15:09:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-01-27 15:09:44,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-01-27 15:09:44,907 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 41 transitions. [2024-01-27 15:09:44,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 172 flow [2024-01-27 15:09:44,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:44,911 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 88 flow [2024-01-27 15:09:44,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-01-27 15:09:44,913 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-01-27 15:09:44,913 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 88 flow [2024-01-27 15:09:44,913 INFO L496 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-01-27 15:09:44,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:44,913 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:44,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:09:44,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-01-27 15:09:44,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 622998633, now seen corresponding path program 1 times [2024-01-27 15:09:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443921878] [2024-01-27 15:09:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:09:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443921878] [2024-01-27 15:09:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443921878] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101954240] [2024-01-27 15:09:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:44,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:44,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:44,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2024-01-27 15:09:44,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 88 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-01-27 15:09:44,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:44,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2024-01-27 15:09:44,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:45,156 INFO L124 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2024-01-27 15:09:45,156 INFO L125 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2024-01-27 15:09:45,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13556 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5575. Up to 1546 conditions per place. [2024-01-27 15:09:45,168 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2024-01-27 15:09:45,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 221 flow [2024-01-27 15:09:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2024-01-27 15:09:45,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-01-27 15:09:45,170 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 88 flow. Second operand 3 states and 38 transitions. [2024-01-27 15:09:45,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 221 flow [2024-01-27 15:09:45,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:09:45,177 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 128 flow [2024-01-27 15:09:45,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-01-27 15:09:45,179 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-01-27 15:09:45,179 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 128 flow [2024-01-27 15:09:45,179 INFO L496 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-01-27 15:09:45,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,180 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2024-01-27 15:09:45,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:09:45,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-01-27 15:09:45,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2132707573, now seen corresponding path program 1 times [2024-01-27 15:09:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416306012] [2024-01-27 15:09:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:45,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:45,229 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:45,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-01-27 15:09:45,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-01-27 15:09:45,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-01-27 15:09:45,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-01-27 15:09:45,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-01-27 15:09:45,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:09:45,231 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-27 15:09:45,232 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:45,232 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-01-27 15:09:45,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:45,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2024-01-27 15:09:45,256 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2024-01-27 15:09:45,256 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-27 15:09:45,256 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-01-27 15:09:45,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2024-01-27 15:09:45,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2024-01-27 15:09:45,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:45,263 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3493d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:45,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 15:09:45,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:45,269 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-01-27 15:09:45,269 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:45,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:45,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 15:09:45,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:45,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1445905400, now seen corresponding path program 1 times [2024-01-27 15:09:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214854782] [2024-01-27 15:09:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214854782] [2024-01-27 15:09:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214854782] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839033721] [2024-01-27 15:09:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:45,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:45,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-01-27 15:09:45,315 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-01-27 15:09:45,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:45,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-01-27 15:09:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:46,239 INFO L124 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2024-01-27 15:09:46,239 INFO L125 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2024-01-27 15:09:46,256 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-01-27 15:09:46,331 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-01-27 15:09:46,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2024-01-27 15:09:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-01-27 15:09:46,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2024-01-27 15:09:46,333 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 84 flow. Second operand 3 states and 53 transitions. [2024-01-27 15:09:46,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 239 flow [2024-01-27 15:09:46,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 227 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:46,335 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 114 flow [2024-01-27 15:09:46,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2024-01-27 15:09:46,336 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2024-01-27 15:09:46,336 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 114 flow [2024-01-27 15:09:46,337 INFO L496 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-01-27 15:09:46,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:46,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:46,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:09:46,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:46,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2065983804, now seen corresponding path program 1 times [2024-01-27 15:09:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409394847] [2024-01-27 15:09:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:09:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:46,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409394847] [2024-01-27 15:09:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409394847] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:46,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644792318] [2024-01-27 15:09:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:46,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:46,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:46,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-01-27 15:09:46,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 114 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-01-27 15:09:46,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:46,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-01-27 15:09:46,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:47,702 INFO L124 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2024-01-27 15:09:47,703 INFO L125 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2024-01-27 15:09:47,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 133464 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 49761. Up to 15062 conditions per place. [2024-01-27 15:09:47,922 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-01-27 15:09:47,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 300 flow [2024-01-27 15:09:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-01-27 15:09:47,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-01-27 15:09:47,926 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 114 flow. Second operand 3 states and 50 transitions. [2024-01-27 15:09:47,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 300 flow [2024-01-27 15:09:47,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:09:47,979 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2024-01-27 15:09:47,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-01-27 15:09:47,981 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-01-27 15:09:47,981 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2024-01-27 15:09:47,981 INFO L496 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-01-27 15:09:47,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:47,981 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:47,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:09:47,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:47,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1151970661, now seen corresponding path program 1 times [2024-01-27 15:09:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992067905] [2024-01-27 15:09:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:09:48,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992067905] [2024-01-27 15:09:48,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992067905] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:48,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:48,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164638815] [2024-01-27 15:09:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:48,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:48,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:48,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-01-27 15:09:48,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 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-01-27 15:09:48,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:48,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-01-27 15:09:48,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:49,608 INFO L124 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2024-01-27 15:09:49,609 INFO L125 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2024-01-27 15:09:49,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79820 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185279 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 71245. Up to 19502 conditions per place. [2024-01-27 15:09:49,886 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2024-01-27 15:09:49,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 409 flow [2024-01-27 15:09:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:09:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:09:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-01-27 15:09:49,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 15:09:49,890 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 3 states and 49 transitions. [2024-01-27 15:09:49,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 409 flow [2024-01-27 15:09:49,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:09:49,949 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 278 flow [2024-01-27 15:09:49,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2024-01-27 15:09:49,951 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2024-01-27 15:09:49,951 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 278 flow [2024-01-27 15:09:49,951 INFO L496 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-01-27 15:09:49,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:49,952 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:49,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:09:49,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:49,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1472775050, now seen corresponding path program 1 times [2024-01-27 15:09:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918163064] [2024-01-27 15:09:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:09:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918163064] [2024-01-27 15:09:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918163064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:09:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059644927] [2024-01-27 15:09:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:50,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:09:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:09:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:09:50,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-01-27 15:09:50,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 278 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-01-27 15:09:50,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:50,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-01-27 15:09:50,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:52,864 INFO L124 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2024-01-27 15:09:52,864 INFO L125 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2024-01-27 15:09:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150159 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 356882 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150074. Up to 16776 conditions per place. [2024-01-27 15:09:53,146 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2024-01-27 15:09:53,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 147 transitions, 1084 flow [2024-01-27 15:09:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:09:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:09:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-01-27 15:09:53,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-01-27 15:09:53,148 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 278 flow. Second operand 6 states and 114 transitions. [2024-01-27 15:09:53,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 147 transitions, 1084 flow [2024-01-27 15:09:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:09:53,316 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 575 flow [2024-01-27 15:09:53,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2024-01-27 15:09:53,317 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2024-01-27 15:09:53,317 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 70 transitions, 575 flow [2024-01-27 15:09:53,317 INFO L496 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-01-27 15:09:53,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:53,318 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:53,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:09:53,318 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:53,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:53,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1135723520, now seen corresponding path program 2 times [2024-01-27 15:09:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:53,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146137921] [2024-01-27 15:09:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:09:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146137921] [2024-01-27 15:09:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146137921] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:09:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217495502] [2024-01-27 15:09:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:53,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:09:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:53,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:09:53,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:09:53,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2024-01-27 15:09:53,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 70 transitions, 575 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-01-27 15:09:53,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:53,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2024-01-27 15:09:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:09:56,671 INFO L124 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2024-01-27 15:09:56,671 INFO L125 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2024-01-27 15:09:56,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183311 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404952 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 96155. Up to 19534 conditions per place. [2024-01-27 15:09:57,023 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-01-27 15:09:57,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 179 transitions, 1515 flow [2024-01-27 15:09:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:09:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:09:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-01-27 15:09:57,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-01-27 15:09:57,025 INFO L175 Difference]: Start difference. First operand has 51 places, 70 transitions, 575 flow. Second operand 7 states and 128 transitions. [2024-01-27 15:09:57,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 179 transitions, 1515 flow [2024-01-27 15:09:57,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:09:57,303 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 1039 flow [2024-01-27 15:09:57,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2024-01-27 15:09:57,303 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-01-27 15:09:57,304 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 1039 flow [2024-01-27 15:09:57,304 INFO L496 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-01-27 15:09:57,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:57,304 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-01-27 15:09:57,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 15:09:57,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-01-27 15:09:57,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1351419360, now seen corresponding path program 1 times [2024-01-27 15:09:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397965077] [2024-01-27 15:09:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:57,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 15:09:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 15:09:57,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 15:09:57,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 15:09:57,320 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-01-27 15:09:57,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 15:09:57,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-01-27 15:09:57,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 15:09:57,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 15:09:57,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 15:09:57,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:09:57,321 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-01-27 15:09:57,322 WARN L234 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-01-27 15:09:57,322 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-01-27 15:09:57,334 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 15:09:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2024-01-27 15:09:57,338 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2024-01-27 15:09:57,338 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-01-27 15:09:57,338 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-01-27 15:09:57,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2024-01-27 15:09:57,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2024-01-27 15:09:57,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:09:57,340 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3493d798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:09:57,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 15:09:57,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:09:57,341 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-01-27 15:09:57,341 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:09:57,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:09:57,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 15:09:57,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:09:57,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:09:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1843080402, now seen corresponding path program 1 times [2024-01-27 15:09:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:09:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510000344] [2024-01-27 15:09:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:09:57,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:09:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:09:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:09:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:09:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510000344] [2024-01-27 15:09:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510000344] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:09:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:09:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:09:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110676214] [2024-01-27 15:09:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:09:57,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:09:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:09:57,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:09:57,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:09:57,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-01-27 15:09:57,359 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-01-27 15:09:57,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:09:57,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-01-27 15:09:57,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:10:02,879 INFO L124 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2024-01-27 15:10:02,879 INFO L125 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2024-01-27 15:10:03,030 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-01-27 15:10:03,438 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-01-27 15:10:03,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2024-01-27 15:10:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:10:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:10:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-01-27 15:10:03,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2024-01-27 15:10:03,440 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 3 states and 65 transitions. [2024-01-27 15:10:03,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 310 flow [2024-01-27 15:10:03,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 286 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-01-27 15:10:03,449 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 140 flow [2024-01-27 15:10:03,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-01-27 15:10:03,450 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-01-27 15:10:03,450 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 140 flow [2024-01-27 15:10:03,450 INFO L496 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-01-27 15:10:03,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:10:03,451 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-01-27 15:10:03,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 15:10:03,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:10:03,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:10:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1680503157, now seen corresponding path program 1 times [2024-01-27 15:10:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:10:03,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87155043] [2024-01-27 15:10:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:10:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:10:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:10:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:10:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:10:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87155043] [2024-01-27 15:10:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87155043] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:10:03,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:10:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:10:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666517004] [2024-01-27 15:10:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:10:03,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:10:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:10:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:10:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:10:03,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-01-27 15:10:03,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 140 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-01-27 15:10:03,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:10:03,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-01-27 15:10:03,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:10:11,870 INFO L124 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2024-01-27 15:10:11,871 INFO L125 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2024-01-27 15:10:12,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429056 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083818 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 382197. Up to 121118 conditions per place. [2024-01-27 15:10:12,820 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-01-27 15:10:12,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 379 flow [2024-01-27 15:10:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:10:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:10:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-01-27 15:10:12,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-01-27 15:10:12,821 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 140 flow. Second operand 3 states and 62 transitions. [2024-01-27 15:10:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 379 flow [2024-01-27 15:10:14,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:10:14,457 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 216 flow [2024-01-27 15:10:14,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-01-27 15:10:14,458 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2024-01-27 15:10:14,458 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 216 flow [2024-01-27 15:10:14,458 INFO L496 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-01-27 15:10:14,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:10:14,458 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:10:14,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 15:10:14,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-01-27 15:10:14,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:10:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -57782282, now seen corresponding path program 1 times [2024-01-27 15:10:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:10:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522332140] [2024-01-27 15:10:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:10:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:10:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:10:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:10:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:10:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522332140] [2024-01-27 15:10:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522332140] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:10:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:10:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:10:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875527776] [2024-01-27 15:10:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:10:14,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:10:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:10:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:10:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:10:14,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2024-01-27 15:10:14,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 216 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-01-27 15:10:14,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:10:14,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2024-01-27 15:10:14,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand