./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:30:47,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:30:47,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:30:47,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:30:47,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:30:47,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:30:47,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:30:47,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:30:47,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:30:47,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:30:47,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:30:47,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:30:47,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:30:47,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:30:47,222 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:30:47,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:30:47,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:30:47,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:30:47,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:30:47,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:30:47,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:30:47,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:30:47,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:30:47,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:30:47,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:30:47,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:30:47,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:30:47,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:30:47,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:30:47,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:30:47,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:30:47,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:30:47,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:30:47,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:30:47,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:30:47,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:30:47,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:30:47,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:30:47,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:30:47,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:30:47,230 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:30:47,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:30:47,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:30:47,231 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 -> 9d6df98e8ac4880739ff8c7fa9cf00b32c56a4c64770b2bc9bcfef3d013872fa Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:30:47,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:30:47,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:30:47,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:30:47,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:30:47,530 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:30:47,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-02-20 11:30:48,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:30:49,010 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:30:49,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-02-20 11:30:49,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eee83772/29da2ad3f6a44fc388ad6dbf4d883b56/FLAG718b920d1 [2024-02-20 11:30:49,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eee83772/29da2ad3f6a44fc388ad6dbf4d883b56 [2024-02-20 11:30:49,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:30:49,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:30:49,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:30:49,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:30:49,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:30:49,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce49625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49, skipping insertion in model container [2024-02-20 11:30:49,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:30:49,282 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-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-02-20 11:30:49,523 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:30:49,533 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:30:49,544 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-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2024-02-20 11:30:49,586 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:30:49,619 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:30:49,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49 WrapperNode [2024-02-20 11:30:49,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:30:49,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:30:49,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:30:49,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:30:49,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,684 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-02-20 11:30:49,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:30:49,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:30:49,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:30:49,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:30:49,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,728 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:30:49,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:30:49,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:30:49,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:30:49,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:30:49,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (1/1) ... [2024-02-20 11:30:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:30:49,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:30:49,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-20 11:30:49,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-20 11:30:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:30:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:30:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:30:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:30:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:30:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:30:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:30:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-20 11:30:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-20 11:30:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-20 11:30:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-20 11:30:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:30:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:30:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:30:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:30:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:30:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:30:49,852 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:30:50,079 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:30:50,081 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:30:50,392 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:30:50,393 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:30:50,591 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:30:50,592 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-20 11:30:50,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:30:50 BoogieIcfgContainer [2024-02-20 11:30:50,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:30:50,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:30:50,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:30:50,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:30:50,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:30:49" (1/3) ... [2024-02-20 11:30:50,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214d61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:30:50, skipping insertion in model container [2024-02-20 11:30:50,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:30:49" (2/3) ... [2024-02-20 11:30:50,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5214d61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:30:50, skipping insertion in model container [2024-02-20 11:30:50,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:30:50" (3/3) ... [2024-02-20 11:30:50,605 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-02-20 11:30:50,622 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:30:50,623 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-20 11:30:50,623 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:30:50,668 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:30:50,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2024-02-20 11:30:50,758 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2024-02-20 11:30:50,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:30:50,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-20 11:30:50,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2024-02-20 11:30:50,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2024-02-20 11:30:50,783 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:30:50,791 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e642d57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:30:50,792 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-20 11:30:50,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:30:50,800 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-20 11:30:50,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:30:50,800 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:50,801 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-20 11:30:50,802 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:50,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1032196371, now seen corresponding path program 1 times [2024-02-20 11:30:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856925722] [2024-02-20 11:30:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856925722] [2024-02-20 11:30:51,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856925722] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:51,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-20 11:30:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638919864] [2024-02-20 11:30:51,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:51,247 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:30:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:51,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:30:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:30:51,279 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2024-02-20 11:30:51,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:51,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:51,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2024-02-20 11:30:51,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:51,539 INFO L124 PetriNetUnfolderBase]: 264/581 cut-off events. [2024-02-20 11:30:51,540 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:30:51,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 581 events. 264/581 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3135 event pairs, 32 based on Foata normal form. 25/599 useless extension candidates. Maximal degree in co-relation 1037. Up to 373 conditions per place. [2024-02-20 11:30:51,570 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 24 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2024-02-20 11:30:51,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 140 flow [2024-02-20 11:30:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:30:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:30:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-20 11:30:51,582 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2024-02-20 11:30:51,585 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-02-20 11:30:51,585 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 140 flow [2024-02-20 11:30:51,585 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:51,586 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:51,586 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:51,586 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:30:51,586 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:51,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1996445702, now seen corresponding path program 1 times [2024-02-20 11:30:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641260677] [2024-02-20 11:30:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:51,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641260677] [2024-02-20 11:30:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641260677] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:51,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:30:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282959605] [2024-02-20 11:30:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:51,891 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:30:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:30:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:30:51,897 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:30:51,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:51,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:51,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:30:51,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:52,263 INFO L124 PetriNetUnfolderBase]: 506/948 cut-off events. [2024-02-20 11:30:52,263 INFO L125 PetriNetUnfolderBase]: For 194/202 co-relation queries the response was YES. [2024-02-20 11:30:52,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 948 events. 506/948 cut-off events. For 194/202 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5118 event pairs, 80 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 2556. Up to 666 conditions per place. [2024-02-20 11:30:52,271 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 31 selfloop transitions, 2 changer transitions 53/94 dead transitions. [2024-02-20 11:30:52,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 94 transitions, 524 flow [2024-02-20 11:30:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:30:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:30:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-02-20 11:30:52,274 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-02-20 11:30:52,274 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2024-02-20 11:30:52,275 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 94 transitions, 524 flow [2024-02-20 11:30:52,275 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:52,275 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:52,275 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:52,276 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:30:52,276 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:52,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 692396317, now seen corresponding path program 1 times [2024-02-20 11:30:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359092744] [2024-02-20 11:30:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359092744] [2024-02-20 11:30:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359092744] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:30:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68689613] [2024-02-20 11:30:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:52,820 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:30:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:30:52,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:30:52,835 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:30:52,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 94 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:52,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:52,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:30:52,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:53,277 INFO L124 PetriNetUnfolderBase]: 638/1225 cut-off events. [2024-02-20 11:30:53,278 INFO L125 PetriNetUnfolderBase]: For 431/447 co-relation queries the response was YES. [2024-02-20 11:30:53,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4402 conditions, 1225 events. 638/1225 cut-off events. For 431/447 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7169 event pairs, 41 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 4386. Up to 862 conditions per place. [2024-02-20 11:30:53,284 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 45 selfloop transitions, 4 changer transitions 149/206 dead transitions. [2024-02-20 11:30:53,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 206 transitions, 1571 flow [2024-02-20 11:30:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:30:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:30:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-02-20 11:30:53,290 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5871212121212122 [2024-02-20 11:30:53,291 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2024-02-20 11:30:53,292 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 206 transitions, 1571 flow [2024-02-20 11:30:53,292 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:53,292 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:53,292 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:53,292 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:30:53,293 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:53,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1941641499, now seen corresponding path program 1 times [2024-02-20 11:30:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400841700] [2024-02-20 11:30:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400841700] [2024-02-20 11:30:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400841700] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:53,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:30:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399854800] [2024-02-20 11:30:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:53,956 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:30:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:30:53,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:30:53,962 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:30:53,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 206 transitions, 1571 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:53,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:53,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:30:53,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:54,657 INFO L124 PetriNetUnfolderBase]: 939/1772 cut-off events. [2024-02-20 11:30:54,658 INFO L125 PetriNetUnfolderBase]: For 1185/1185 co-relation queries the response was YES. [2024-02-20 11:30:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7770 conditions, 1772 events. 939/1772 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10936 event pairs, 49 based on Foata normal form. 0/1760 useless extension candidates. Maximal degree in co-relation 7751. Up to 1215 conditions per place. [2024-02-20 11:30:54,666 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 61 selfloop transitions, 25 changer transitions 282/377 dead transitions. [2024-02-20 11:30:54,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 377 transitions, 3605 flow [2024-02-20 11:30:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-20 11:30:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-20 11:30:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2024-02-20 11:30:54,669 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-02-20 11:30:54,669 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2024-02-20 11:30:54,670 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 377 transitions, 3605 flow [2024-02-20 11:30:54,670 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:54,670 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:54,670 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:54,670 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:30:54,671 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:54,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 59551135, now seen corresponding path program 2 times [2024-02-20 11:30:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:54,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122525020] [2024-02-20 11:30:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122525020] [2024-02-20 11:30:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122525020] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:30:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988928818] [2024-02-20 11:30:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:55,468 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:30:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:55,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:30:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:30:55,487 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:30:55,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 377 transitions, 3605 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:55,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:55,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:30:55,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:56,641 INFO L124 PetriNetUnfolderBase]: 2192/3809 cut-off events. [2024-02-20 11:30:56,641 INFO L125 PetriNetUnfolderBase]: For 5174/5185 co-relation queries the response was YES. [2024-02-20 11:30:56,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19312 conditions, 3809 events. 2192/3809 cut-off events. For 5174/5185 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24118 event pairs, 158 based on Foata normal form. 0/3770 useless extension candidates. Maximal degree in co-relation 19290. Up to 2479 conditions per place. [2024-02-20 11:30:56,662 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 96 selfloop transitions, 28 changer transitions 556/687 dead transitions. [2024-02-20 11:30:56,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 687 transitions, 7861 flow [2024-02-20 11:30:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:30:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:30:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 276 transitions. [2024-02-20 11:30:56,664 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4919786096256685 [2024-02-20 11:30:56,666 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2024-02-20 11:30:56,667 INFO L507 AbstractCegarLoop]: Abstraction has has 83 places, 687 transitions, 7861 flow [2024-02-20 11:30:56,667 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:56,667 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:56,667 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:56,667 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:30:56,668 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:56,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 100483983, now seen corresponding path program 3 times [2024-02-20 11:30:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:56,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122248280] [2024-02-20 11:30:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122248280] [2024-02-20 11:30:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122248280] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:57,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:30:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268428986] [2024-02-20 11:30:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:57,196 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:30:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:30:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:30:57,207 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:30:57,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 687 transitions, 7861 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:57,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:57,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:30:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:30:58,598 INFO L124 PetriNetUnfolderBase]: 2787/4829 cut-off events. [2024-02-20 11:30:58,599 INFO L125 PetriNetUnfolderBase]: For 10553/10576 co-relation queries the response was YES. [2024-02-20 11:30:58,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28571 conditions, 4829 events. 2787/4829 cut-off events. For 10553/10576 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 31704 event pairs, 225 based on Foata normal form. 0/4787 useless extension candidates. Maximal degree in co-relation 28546. Up to 3233 conditions per place. [2024-02-20 11:30:58,629 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 114 selfloop transitions, 22 changer transitions 781/928 dead transitions. [2024-02-20 11:30:58,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 928 transitions, 12515 flow [2024-02-20 11:30:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:30:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:30:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 298 transitions. [2024-02-20 11:30:58,632 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5311942959001783 [2024-02-20 11:30:58,634 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 62 predicate places. [2024-02-20 11:30:58,634 INFO L507 AbstractCegarLoop]: Abstraction has has 99 places, 928 transitions, 12515 flow [2024-02-20 11:30:58,634 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:58,634 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:30:58,635 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:30:58,635 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:30:58,635 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:30:58,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:30:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -216513783, now seen corresponding path program 1 times [2024-02-20 11:30:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:30:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78799129] [2024-02-20 11:30:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:30:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:30:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:30:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:30:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:30:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78799129] [2024-02-20 11:30:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78799129] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:30:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:30:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-20 11:30:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226160914] [2024-02-20 11:30:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:30:59,422 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:30:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:30:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:30:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:30:59,430 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:30:59,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 928 transitions, 12515 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:30:59,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:30:59,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:30:59,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:01,427 INFO L124 PetriNetUnfolderBase]: 3826/6643 cut-off events. [2024-02-20 11:31:01,428 INFO L125 PetriNetUnfolderBase]: For 23579/23677 co-relation queries the response was YES. [2024-02-20 11:31:01,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44596 conditions, 6643 events. 3826/6643 cut-off events. For 23579/23677 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 46804 event pairs, 309 based on Foata normal form. 4/6580 useless extension candidates. Maximal degree in co-relation 44568. Up to 4460 conditions per place. [2024-02-20 11:31:01,463 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 125 selfloop transitions, 22 changer transitions 1197/1355 dead transitions. [2024-02-20 11:31:01,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 1355 transitions, 21059 flow [2024-02-20 11:31:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-20 11:31:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-20 11:31:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 379 transitions. [2024-02-20 11:31:01,465 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4993412384716733 [2024-02-20 11:31:01,466 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2024-02-20 11:31:01,466 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 1355 transitions, 21059 flow [2024-02-20 11:31:01,466 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:01,466 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:01,466 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:01,466 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:31:01,467 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:01,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash -627170569, now seen corresponding path program 1 times [2024-02-20 11:31:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:01,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506081115] [2024-02-20 11:31:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506081115] [2024-02-20 11:31:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506081115] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:02,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:02,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:31:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16679034] [2024-02-20 11:31:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:02,043 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:31:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:31:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:31:02,058 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:31:02,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 1355 transitions, 21059 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:02,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:02,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:31:02,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:04,985 INFO L124 PetriNetUnfolderBase]: 4965/8591 cut-off events. [2024-02-20 11:31:04,986 INFO L125 PetriNetUnfolderBase]: For 31732/32057 co-relation queries the response was YES. [2024-02-20 11:31:05,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66163 conditions, 8591 events. 4965/8591 cut-off events. For 31732/32057 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 62750 event pairs, 467 based on Foata normal form. 38/8556 useless extension candidates. Maximal degree in co-relation 66132. Up to 5878 conditions per place. [2024-02-20 11:31:05,034 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 143 selfloop transitions, 61 changer transitions 1642/1853 dead transitions. [2024-02-20 11:31:05,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 1853 transitions, 32077 flow [2024-02-20 11:31:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-02-20 11:31:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2024-02-20 11:31:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 625 transitions. [2024-02-20 11:31:05,041 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4509379509379509 [2024-02-20 11:31:05,043 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 125 predicate places. [2024-02-20 11:31:05,043 INFO L507 AbstractCegarLoop]: Abstraction has has 162 places, 1853 transitions, 32077 flow [2024-02-20 11:31:05,043 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:05,043 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:05,043 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:05,044 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:31:05,044 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:05,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash -859739389, now seen corresponding path program 2 times [2024-02-20 11:31:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116974249] [2024-02-20 11:31:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:05,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:05,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116974249] [2024-02-20 11:31:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116974249] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:05,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:05,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-20 11:31:05,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669838300] [2024-02-20 11:31:05,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:05,544 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:31:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:05,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:31:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:31:05,566 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:31:05,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 1853 transitions, 32077 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:05,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:05,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:31:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:08,313 INFO L124 PetriNetUnfolderBase]: 5711/9898 cut-off events. [2024-02-20 11:31:08,313 INFO L125 PetriNetUnfolderBase]: For 38825/39287 co-relation queries the response was YES. [2024-02-20 11:31:08,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85955 conditions, 9898 events. 5711/9898 cut-off events. For 38825/39287 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 74189 event pairs, 461 based on Foata normal form. 41/9869 useless extension candidates. Maximal degree in co-relation 85921. Up to 6817 conditions per place. [2024-02-20 11:31:08,369 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 179 selfloop transitions, 41 changer transitions 2055/2282 dead transitions. [2024-02-20 11:31:08,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 2282 transitions, 43757 flow [2024-02-20 11:31:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:31:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:31:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 220 transitions. [2024-02-20 11:31:08,371 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-02-20 11:31:08,372 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 137 predicate places. [2024-02-20 11:31:08,372 INFO L507 AbstractCegarLoop]: Abstraction has has 174 places, 2282 transitions, 43757 flow [2024-02-20 11:31:08,372 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:08,372 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:08,372 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:08,373 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:31:08,373 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:08,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash 615428707, now seen corresponding path program 2 times [2024-02-20 11:31:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108587707] [2024-02-20 11:31:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108587707] [2024-02-20 11:31:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108587707] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:09,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:09,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:31:09,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45653711] [2024-02-20 11:31:09,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:09,306 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:31:09,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:31:09,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:31:09,312 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:31:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 2282 transitions, 43757 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:31:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:13,384 INFO L124 PetriNetUnfolderBase]: 8203/14200 cut-off events. [2024-02-20 11:31:13,384 INFO L125 PetriNetUnfolderBase]: For 69812/70564 co-relation queries the response was YES. [2024-02-20 11:31:13,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134460 conditions, 14200 events. 8203/14200 cut-off events. For 69812/70564 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 113230 event pairs, 620 based on Foata normal form. 30/14161 useless extension candidates. Maximal degree in co-relation 134423. Up to 9764 conditions per place. [2024-02-20 11:31:13,468 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 203 selfloop transitions, 41 changer transitions 3134/3393 dead transitions. [2024-02-20 11:31:13,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 3393 transitions, 72257 flow [2024-02-20 11:31:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 11:31:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 11:31:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 250 transitions. [2024-02-20 11:31:13,470 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2024-02-20 11:31:13,472 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 150 predicate places. [2024-02-20 11:31:13,472 INFO L507 AbstractCegarLoop]: Abstraction has has 187 places, 3393 transitions, 72257 flow [2024-02-20 11:31:13,472 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:13,472 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:13,473 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:13,473 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:31:13,473 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:13,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 928361405, now seen corresponding path program 3 times [2024-02-20 11:31:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395347605] [2024-02-20 11:31:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395347605] [2024-02-20 11:31:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395347605] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:31:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109935958] [2024-02-20 11:31:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:14,334 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:31:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:14,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:31:14,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:31:14,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:31:14,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 3393 transitions, 72257 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:14,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:14,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:31:14,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:21,288 INFO L124 PetriNetUnfolderBase]: 8693/15066 cut-off events. [2024-02-20 11:31:21,288 INFO L125 PetriNetUnfolderBase]: For 100241/101179 co-relation queries the response was YES. [2024-02-20 11:31:21,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154932 conditions, 15066 events. 8693/15066 cut-off events. For 100241/101179 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 121415 event pairs, 656 based on Foata normal form. 22/15009 useless extension candidates. Maximal degree in co-relation 154892. Up to 10367 conditions per place. [2024-02-20 11:31:21,363 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 173 selfloop transitions, 79 changer transitions 3329/3596 dead transitions. [2024-02-20 11:31:21,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 3596 transitions, 83603 flow [2024-02-20 11:31:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-20 11:31:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-20 11:31:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 371 transitions. [2024-02-20 11:31:21,365 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2024-02-20 11:31:21,366 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 170 predicate places. [2024-02-20 11:31:21,366 INFO L507 AbstractCegarLoop]: Abstraction has has 207 places, 3596 transitions, 83603 flow [2024-02-20 11:31:21,366 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:21,366 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:21,366 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:21,367 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 11:31:21,367 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:21,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1644890957, now seen corresponding path program 3 times [2024-02-20 11:31:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346054905] [2024-02-20 11:31:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:22,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346054905] [2024-02-20 11:31:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346054905] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:22,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-02-20 11:31:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180685193] [2024-02-20 11:31:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:22,354 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-20 11:31:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-20 11:31:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-02-20 11:31:22,373 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:31:22,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 3596 transitions, 83603 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:22,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:22,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:31:22,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:30,930 INFO L124 PetriNetUnfolderBase]: 9972/17308 cut-off events. [2024-02-20 11:31:30,931 INFO L125 PetriNetUnfolderBase]: For 123564/124853 co-relation queries the response was YES. [2024-02-20 11:31:30,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194087 conditions, 17308 events. 9972/17308 cut-off events. For 123564/124853 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 142557 event pairs, 561 based on Foata normal form. 18/17235 useless extension candidates. Maximal degree in co-relation 194044. Up to 11878 conditions per place. [2024-02-20 11:31:31,015 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 225 selfloop transitions, 64 changer transitions 3955/4251 dead transitions. [2024-02-20 11:31:31,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 4251 transitions, 107261 flow [2024-02-20 11:31:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-20 11:31:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-20 11:31:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 356 transitions. [2024-02-20 11:31:31,018 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46903820816864294 [2024-02-20 11:31:31,018 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 192 predicate places. [2024-02-20 11:31:31,018 INFO L507 AbstractCegarLoop]: Abstraction has has 229 places, 4251 transitions, 107261 flow [2024-02-20 11:31:31,019 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:31,019 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:31,019 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:31,019 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-20 11:31:31,019 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:31,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -873566391, now seen corresponding path program 4 times [2024-02-20 11:31:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956471917] [2024-02-20 11:31:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956471917] [2024-02-20 11:31:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956471917] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-02-20 11:31:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338750187] [2024-02-20 11:31:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:31,969 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-20 11:31:31,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-20 11:31:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-02-20 11:31:31,983 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:31:31,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 4251 transitions, 107261 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:31,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:31,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:31:31,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:43,738 INFO L124 PetriNetUnfolderBase]: 10805/18723 cut-off events. [2024-02-20 11:31:43,738 INFO L125 PetriNetUnfolderBase]: For 143826/145373 co-relation queries the response was YES. [2024-02-20 11:31:43,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227488 conditions, 18723 events. 10805/18723 cut-off events. For 143826/145373 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 155630 event pairs, 431 based on Foata normal form. 3/18639 useless extension candidates. Maximal degree in co-relation 227442. Up to 12858 conditions per place. [2024-02-20 11:31:43,836 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 283 selfloop transitions, 47 changer transitions 4751/5088 dead transitions. [2024-02-20 11:31:43,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 5088 transitions, 138517 flow [2024-02-20 11:31:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:31:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:31:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 319 transitions. [2024-02-20 11:31:43,838 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-02-20 11:31:43,838 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 211 predicate places. [2024-02-20 11:31:43,838 INFO L507 AbstractCegarLoop]: Abstraction has has 248 places, 5088 transitions, 138517 flow [2024-02-20 11:31:43,839 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:43,839 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:43,839 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:43,839 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 11:31:43,839 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:43,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -315670376, now seen corresponding path program 1 times [2024-02-20 11:31:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515524010] [2024-02-20 11:31:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:43,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:44,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515524010] [2024-02-20 11:31:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515524010] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:31:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610312993] [2024-02-20 11:31:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:44,525 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:31:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:31:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:31:44,531 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:31:44,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 5088 transitions, 138517 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:44,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:44,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:31:44,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:58,581 INFO L124 PetriNetUnfolderBase]: 11975/20771 cut-off events. [2024-02-20 11:31:58,581 INFO L125 PetriNetUnfolderBase]: For 197081/198856 co-relation queries the response was YES. [2024-02-20 11:31:58,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269305 conditions, 20771 events. 11975/20771 cut-off events. For 197081/198856 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 175735 event pairs, 526 based on Foata normal form. 3/20687 useless extension candidates. Maximal degree in co-relation 269256. Up to 14280 conditions per place. [2024-02-20 11:31:58,686 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 254 selfloop transitions, 90 changer transitions 5117/5479 dead transitions. [2024-02-20 11:31:58,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 5479 transitions, 159973 flow [2024-02-20 11:31:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-02-20 11:31:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-02-20 11:31:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 595 transitions. [2024-02-20 11:31:58,691 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5008417508417509 [2024-02-20 11:31:58,691 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 246 predicate places. [2024-02-20 11:31:58,692 INFO L507 AbstractCegarLoop]: Abstraction has has 283 places, 5479 transitions, 159973 flow [2024-02-20 11:31:58,692 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:58,692 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:58,692 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:58,692 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-20 11:31:58,692 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:31:58,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 410812572, now seen corresponding path program 2 times [2024-02-20 11:31:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:58,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262681483] [2024-02-20 11:31:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262681483] [2024-02-20 11:31:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262681483] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:31:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:31:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:31:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504534783] [2024-02-20 11:31:58,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:31:58,945 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:31:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:31:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:31:58,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-02-20 11:31:58,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 5479 transitions, 159973 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:31:58,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:58,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-02-20 11:31:58,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:32:15,626 INFO L124 PetriNetUnfolderBase]: 13181/22882 cut-off events. [2024-02-20 11:32:15,626 INFO L125 PetriNetUnfolderBase]: For 247274/248834 co-relation queries the response was YES. [2024-02-20 11:32:15,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315102 conditions, 22882 events. 13181/22882 cut-off events. For 247274/248834 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 196791 event pairs, 619 based on Foata normal form. 3/22804 useless extension candidates. Maximal degree in co-relation 315050. Up to 15752 conditions per place. [2024-02-20 11:32:15,762 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 240 selfloop transitions, 34 changer transitions 5555/5852 dead transitions. [2024-02-20 11:32:15,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 5852 transitions, 182359 flow [2024-02-20 11:32:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 11:32:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 11:32:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-02-20 11:32:15,764 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6026936026936027 [2024-02-20 11:32:15,764 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 254 predicate places. [2024-02-20 11:32:15,764 INFO L507 AbstractCegarLoop]: Abstraction has has 291 places, 5852 transitions, 182359 flow [2024-02-20 11:32:15,765 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:32:15,765 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:32:15,765 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:32:15,765 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-20 11:32:15,765 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:32:15,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:32:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 980154767, now seen corresponding path program 1 times [2024-02-20 11:32:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:32:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949524682] [2024-02-20 11:32:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:32:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:32:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:32:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:32:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:32:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949524682] [2024-02-20 11:32:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949524682] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:32:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:32:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:32:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825490104] [2024-02-20 11:32:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:32:16,952 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:32:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:32:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:32:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:32:16,974 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:32:16,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 5852 transitions, 182359 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:32:16,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:32:16,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:32:16,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:32:41,524 INFO L124 PetriNetUnfolderBase]: 15436/26901 cut-off events. [2024-02-20 11:32:41,524 INFO L125 PetriNetUnfolderBase]: For 304997/307128 co-relation queries the response was YES. [2024-02-20 11:32:41,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396034 conditions, 26901 events. 15436/26901 cut-off events. For 304997/307128 co-relation queries the response was YES. Maximal size of possible extension queue 1759. Compared 237915 event pairs, 702 based on Foata normal form. 41/26856 useless extension candidates. Maximal degree in co-relation 395979. Up to 18473 conditions per place. [2024-02-20 11:32:41,698 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 250 selfloop transitions, 80 changer transitions 6789/7126 dead transitions. [2024-02-20 11:32:41,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 7126 transitions, 235247 flow [2024-02-20 11:32:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-02-20 11:32:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-02-20 11:32:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 465 transitions. [2024-02-20 11:32:41,700 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48589341692789967 [2024-02-20 11:32:41,700 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 282 predicate places. [2024-02-20 11:32:41,700 INFO L507 AbstractCegarLoop]: Abstraction has has 319 places, 7126 transitions, 235247 flow [2024-02-20 11:32:41,701 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:32:41,701 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:32:41,701 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:32:41,701 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-20 11:32:41,701 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:32:41,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:32:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1470204976, now seen corresponding path program 3 times [2024-02-20 11:32:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:32:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556885530] [2024-02-20 11:32:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:32:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:32:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:32:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:32:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:32:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556885530] [2024-02-20 11:32:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556885530] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:32:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:32:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:32:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464263296] [2024-02-20 11:32:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:32:42,068 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:32:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:32:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:32:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:32:42,072 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:32:42,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 7126 transitions, 235247 flow. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:32:42,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:32:42,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:32:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:19,911 INFO L124 PetriNetUnfolderBase]: 18887/33051 cut-off events. [2024-02-20 11:33:19,911 INFO L125 PetriNetUnfolderBase]: For 417115/418959 co-relation queries the response was YES. [2024-02-20 11:33:19,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513117 conditions, 33051 events. 18887/33051 cut-off events. For 417115/418959 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 301985 event pairs, 1174 based on Foata normal form. 55/33021 useless extension candidates. Maximal degree in co-relation 513059. Up to 22664 conditions per place. [2024-02-20 11:33:20,134 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 231 selfloop transitions, 84 changer transitions 8108/8447 dead transitions. [2024-02-20 11:33:20,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 8447 transitions, 296291 flow [2024-02-20 11:33:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-20 11:33:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-20 11:33:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 433 transitions. [2024-02-20 11:33:20,135 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5248484848484849 [2024-02-20 11:33:20,136 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 306 predicate places. [2024-02-20 11:33:20,136 INFO L507 AbstractCegarLoop]: Abstraction has has 343 places, 8447 transitions, 296291 flow [2024-02-20 11:33:20,136 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:33:20,136 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:20,136 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:20,136 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-02-20 11:33:20,136 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:33:20,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 461237596, now seen corresponding path program 4 times [2024-02-20 11:33:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52211690] [2024-02-20 11:33:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:33:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52211690] [2024-02-20 11:33:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52211690] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:20,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:33:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760767072] [2024-02-20 11:33:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:20,552 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:33:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:20,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:33:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:33:20,560 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-02-20 11:33:20,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 8447 transitions, 296291 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:33:20,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:20,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-02-20 11:33:20,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:34:08,415 INFO L124 PetriNetUnfolderBase]: 19319/33847 cut-off events. [2024-02-20 11:34:08,415 INFO L125 PetriNetUnfolderBase]: For 495395/497233 co-relation queries the response was YES. [2024-02-20 11:34:08,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551468 conditions, 33847 events. 19319/33847 cut-off events. For 495395/497233 co-relation queries the response was YES. Maximal size of possible extension queue 2251. Compared 310897 event pairs, 1310 based on Foata normal form. 3/33761 useless extension candidates. Maximal degree in co-relation 551407. Up to 23125 conditions per place. [2024-02-20 11:34:08,657 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 240 selfloop transitions, 68 changer transitions 8259/8591 dead transitions. [2024-02-20 11:34:08,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 8591 transitions, 318111 flow [2024-02-20 11:34:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:34:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:34:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 347 transitions. [2024-02-20 11:34:08,659 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5257575757575758 [2024-02-20 11:34:08,659 INFO L308 CegarLoopForPetriNet]: 37 programPoint places, 325 predicate places. [2024-02-20 11:34:08,659 INFO L507 AbstractCegarLoop]: Abstraction has has 362 places, 8591 transitions, 318111 flow [2024-02-20 11:34:08,659 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:34:08,660 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:34:08,660 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:34:08,660 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-02-20 11:34:08,660 INFO L432 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:34:08,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:34:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1253902159, now seen corresponding path program 2 times [2024-02-20 11:34:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:34:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778557921] [2024-02-20 11:34:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:34:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:34:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:34:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:34:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778557921] [2024-02-20 11:34:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778557921] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:34:09,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:34:09,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:34:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190703260] [2024-02-20 11:34:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:34:09,013 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:34:09,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:34:09,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:34:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:34:09,030 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:34:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 8591 transitions, 318111 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:34:09,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:34:09,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:34:09,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand