./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/safe032_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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 08:12:07,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 08:12:07,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 08:12:07,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 08:12:07,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 08:12:07,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 08:12:07,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 08:12:07,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 08:12:07,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 08:12:07,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 08:12:07,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 08:12:07,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 08:12:07,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 08:12:07,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 08:12:07,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 08:12:07,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 08:12:07,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 08:12:07,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 08:12:07,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 08:12:07,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 08:12:07,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 08:12:07,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 08:12:07,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 08:12:07,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 08:12:07,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 08:12:07,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 08:12:07,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 08:12:07,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 08:12:07,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 08:12:07,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 08:12:07,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:12:07,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 08:12:07,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 08:12:07,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 08:12:07,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 08:12:07,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 08:12:07,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 08:12:07,465 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-12 08:12:07,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 08:12:07,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 08:12:07,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 08:12:07,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 08:12:07,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 08:12:07,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-12 08:12:08,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 08:12:09,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 08:12:09,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-12 08:12:09,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f6fe0dc/1629b224e9884df1806967cc57b46c88/FLAGaf9d7bf02 [2024-11-12 08:12:09,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f6fe0dc/1629b224e9884df1806967cc57b46c88 [2024-11-12 08:12:09,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 08:12:09,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 08:12:09,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 08:12:09,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 08:12:09,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 08:12:09,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9e0f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09, skipping insertion in model container [2024-11-12 08:12:09,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 08:12:09,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-12 08:12:09,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:12:09,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 08:12:09,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-12 08:12:09,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:12:09,764 INFO L204 MainTranslator]: Completed translation [2024-11-12 08:12:09,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09 WrapperNode [2024-11-12 08:12:09,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 08:12:09,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 08:12:09,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 08:12:09,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 08:12:09,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,834 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-12 08:12:09,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 08:12:09,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 08:12:09,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 08:12:09,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 08:12:09,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 08:12:09,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 08:12:09,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 08:12:09,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 08:12:09,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 08:12:09,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (1/1) ... [2024-11-12 08:12:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:12:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:12:09,945 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-11-12 08:12:09,949 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-11-12 08:12:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 08:12:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 08:12:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-12 08:12:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-12 08:12:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-12 08:12:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-12 08:12:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-12 08:12:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-12 08:12:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 08:12:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 08:12:09,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 08:12:09,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 08:12:09,995 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 08:12:10,102 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 08:12:10,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 08:12:10,459 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 08:12:10,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 08:12:10,668 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 08:12:10,669 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 08:12:10,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:12:10 BoogieIcfgContainer [2024-11-12 08:12:10,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 08:12:10,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 08:12:10,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 08:12:10,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 08:12:10,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:12:09" (1/3) ... [2024-11-12 08:12:10,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da86d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:12:10, skipping insertion in model container [2024-11-12 08:12:10,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:12:09" (2/3) ... [2024-11-12 08:12:10,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da86d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:12:10, skipping insertion in model container [2024-11-12 08:12:10,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:12:10" (3/3) ... [2024-11-12 08:12:10,679 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-12 08:12:10,694 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 08:12:10,694 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 08:12:10,694 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 08:12:10,748 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 08:12:10,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-12 08:12:10,799 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-12 08:12:10,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 08:12:10,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-12 08:12:10,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-12 08:12:10,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-12 08:12:10,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 08:12:10,817 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20d7ebe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 08:12:10,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 08:12:10,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 08:12:10,823 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-12 08:12:10,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 08:12:10,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:10,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:10,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -515892989, now seen corresponding path program 1 times [2024-11-12 08:12:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063920593] [2024-11-12 08:12:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:11,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:11,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063920593] [2024-11-12 08:12:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063920593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 08:12:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650780178] [2024-11-12 08:12:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 08:12:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 08:12:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 08:12:11,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-12 08:12:11,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-12 08:12:11,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:11,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-12 08:12:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:11,792 INFO L124 PetriNetUnfolderBase]: 920/1670 cut-off events. [2024-11-12 08:12:11,792 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-12 08:12:11,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1670 events. 920/1670 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10861 event pairs, 188 based on Foata normal form. 60/1699 useless extension candidates. Maximal degree in co-relation 3079. Up to 1048 conditions per place. [2024-11-12 08:12:11,803 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-11-12 08:12:11,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 171 flow [2024-11-12 08:12:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 08:12:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 08:12:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-12 08:12:11,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7317073170731707 [2024-11-12 08:12:11,814 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 90 transitions. [2024-11-12 08:12:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 171 flow [2024-11-12 08:12:11,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 08:12:11,819 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-12 08:12:11,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-12 08:12:11,823 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-12 08:12:11,824 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-12 08:12:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-12 08:12:11,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:11,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 08:12:11,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 718352395, now seen corresponding path program 1 times [2024-11-12 08:12:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318003297] [2024-11-12 08:12:11,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318003297] [2024-11-12 08:12:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318003297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:12:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247877749] [2024-11-12 08:12:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:12:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:12:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:12:12,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:12,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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-11-12 08:12:12,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:12,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:12,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:13,319 INFO L124 PetriNetUnfolderBase]: 2805/4495 cut-off events. [2024-11-12 08:12:13,319 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-12 08:12:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4495 events. 2805/4495 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29288 event pairs, 834 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 8847. Up to 2284 conditions per place. [2024-11-12 08:12:13,338 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 39 selfloop transitions, 11 changer transitions 80/141 dead transitions. [2024-11-12 08:12:13,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 141 transitions, 568 flow [2024-11-12 08:12:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 08:12:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 08:12:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 301 transitions. [2024-11-12 08:12:13,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6117886178861789 [2024-11-12 08:12:13,342 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 301 transitions. [2024-11-12 08:12:13,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 141 transitions, 568 flow [2024-11-12 08:12:13,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 141 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 08:12:13,347 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 186 flow [2024-11-12 08:12:13,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-12 08:12:13,348 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2024-11-12 08:12:13,349 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 186 flow [2024-11-12 08:12:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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-11-12 08:12:13,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:13,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 08:12:13,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:13,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash -33432628, now seen corresponding path program 1 times [2024-11-12 08:12:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424631997] [2024-11-12 08:12:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424631997] [2024-11-12 08:12:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424631997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:13,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:12:13,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825355132] [2024-11-12 08:12:13,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:13,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:12:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:12:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:12:13,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:13,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 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-11-12 08:12:13,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:13,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:14,430 INFO L124 PetriNetUnfolderBase]: 1908/3086 cut-off events. [2024-11-12 08:12:14,430 INFO L125 PetriNetUnfolderBase]: For 6045/6045 co-relation queries the response was YES. [2024-11-12 08:12:14,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 3086 events. 1908/3086 cut-off events. For 6045/6045 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19260 event pairs, 395 based on Foata normal form. 105/3174 useless extension candidates. Maximal degree in co-relation 11024. Up to 1458 conditions per place. [2024-11-12 08:12:14,450 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 46 selfloop transitions, 10 changer transitions 58/125 dead transitions. [2024-11-12 08:12:14,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 830 flow [2024-11-12 08:12:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2024-11-12 08:12:14,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5829268292682926 [2024-11-12 08:12:14,455 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 186 flow. Second operand 10 states and 239 transitions. [2024-11-12 08:12:14,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 830 flow [2024-11-12 08:12:14,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 760 flow, removed 35 selfloop flow, removed 5 redundant places. [2024-11-12 08:12:14,484 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 277 flow [2024-11-12 08:12:14,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-12 08:12:14,486 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-11-12 08:12:14,486 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 277 flow [2024-11-12 08:12:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 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-11-12 08:12:14,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:14,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 08:12:14,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1041094976, now seen corresponding path program 1 times [2024-11-12 08:12:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976882734] [2024-11-12 08:12:14,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976882734] [2024-11-12 08:12:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976882734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:15,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:12:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036640694] [2024-11-12 08:12:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:15,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:12:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:12:15,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:12:15,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:15,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-11-12 08:12:15,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:15,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:15,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:15,624 INFO L124 PetriNetUnfolderBase]: 1561/2667 cut-off events. [2024-11-12 08:12:15,625 INFO L125 PetriNetUnfolderBase]: For 6406/6478 co-relation queries the response was YES. [2024-11-12 08:12:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2667 events. 1561/2667 cut-off events. For 6406/6478 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16869 event pairs, 181 based on Foata normal form. 115/2755 useless extension candidates. Maximal degree in co-relation 9605. Up to 1644 conditions per place. [2024-11-12 08:12:15,644 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 48 selfloop transitions, 8 changer transitions 31/105 dead transitions. [2024-11-12 08:12:15,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 757 flow [2024-11-12 08:12:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 08:12:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 08:12:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-11-12 08:12:15,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2024-11-12 08:12:15,646 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 277 flow. Second operand 8 states and 194 transitions. [2024-11-12 08:12:15,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 757 flow [2024-11-12 08:12:15,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 717 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-11-12 08:12:15,662 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 346 flow [2024-11-12 08:12:15,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-11-12 08:12:15,663 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2024-11-12 08:12:15,664 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 346 flow [2024-11-12 08:12:15,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-11-12 08:12:15,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:15,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:15,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 08:12:15,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:15,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash 547590798, now seen corresponding path program 2 times [2024-11-12 08:12:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536560811] [2024-11-12 08:12:15,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536560811] [2024-11-12 08:12:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536560811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:16,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 08:12:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534311388] [2024-11-12 08:12:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:16,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 08:12:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 08:12:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 08:12:16,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 346 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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-11-12 08:12:16,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:16,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:17,379 INFO L124 PetriNetUnfolderBase]: 2084/3498 cut-off events. [2024-11-12 08:12:17,379 INFO L125 PetriNetUnfolderBase]: For 9735/9874 co-relation queries the response was YES. [2024-11-12 08:12:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14359 conditions, 3498 events. 2084/3498 cut-off events. For 9735/9874 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 22584 event pairs, 202 based on Foata normal form. 217/3683 useless extension candidates. Maximal degree in co-relation 14329. Up to 1819 conditions per place. [2024-11-12 08:12:17,420 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 39 changer transitions 42/169 dead transitions. [2024-11-12 08:12:17,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1430 flow [2024-11-12 08:12:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 08:12:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 08:12:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 320 transitions. [2024-11-12 08:12:17,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5574912891986062 [2024-11-12 08:12:17,423 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 346 flow. Second operand 14 states and 320 transitions. [2024-11-12 08:12:17,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1430 flow [2024-11-12 08:12:17,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 169 transitions, 1366 flow, removed 29 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:17,450 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 822 flow [2024-11-12 08:12:17,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=822, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2024-11-12 08:12:17,451 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2024-11-12 08:12:17,451 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 822 flow [2024-11-12 08:12:17,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 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-11-12 08:12:17,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:17,452 INFO L206 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-11-12 08:12:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 08:12:17,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:17,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 279130414, now seen corresponding path program 1 times [2024-11-12 08:12:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426884361] [2024-11-12 08:12:17,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426884361] [2024-11-12 08:12:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426884361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:12:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117364763] [2024-11-12 08:12:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:12:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:12:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:12:17,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:17,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-11-12 08:12:17,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:17,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:17,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:18,459 INFO L124 PetriNetUnfolderBase]: 3106/5292 cut-off events. [2024-11-12 08:12:18,460 INFO L125 PetriNetUnfolderBase]: For 16919/16940 co-relation queries the response was YES. [2024-11-12 08:12:18,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22455 conditions, 5292 events. 3106/5292 cut-off events. For 16919/16940 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37513 event pairs, 831 based on Foata normal form. 82/5320 useless extension candidates. Maximal degree in co-relation 22425. Up to 2116 conditions per place. [2024-11-12 08:12:18,501 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 75 selfloop transitions, 7 changer transitions 86/181 dead transitions. [2024-11-12 08:12:18,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 181 transitions, 1911 flow [2024-11-12 08:12:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 08:12:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 08:12:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-12 08:12:18,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2024-11-12 08:12:18,503 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 822 flow. Second operand 7 states and 166 transitions. [2024-11-12 08:12:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 181 transitions, 1911 flow [2024-11-12 08:12:18,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 181 transitions, 1623 flow, removed 144 selfloop flow, removed 1 redundant places. [2024-11-12 08:12:18,535 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 584 flow [2024-11-12 08:12:18,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2024-11-12 08:12:18,537 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-12 08:12:18,537 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 584 flow [2024-11-12 08:12:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-11-12 08:12:18,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:18,538 INFO L206 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-11-12 08:12:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 08:12:18,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash -629371760, now seen corresponding path program 1 times [2024-11-12 08:12:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394721564] [2024-11-12 08:12:18,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:19,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:19,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394721564] [2024-11-12 08:12:19,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394721564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:19,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:19,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 08:12:19,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016585350] [2024-11-12 08:12:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:19,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 08:12:19,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:19,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 08:12:19,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 08:12:19,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:19,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 584 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 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-11-12 08:12:19,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:19,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:19,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:19,955 INFO L124 PetriNetUnfolderBase]: 2664/4609 cut-off events. [2024-11-12 08:12:19,955 INFO L125 PetriNetUnfolderBase]: For 18509/18715 co-relation queries the response was YES. [2024-11-12 08:12:19,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20139 conditions, 4609 events. 2664/4609 cut-off events. For 18509/18715 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 32231 event pairs, 478 based on Foata normal form. 192/4724 useless extension candidates. Maximal degree in co-relation 20104. Up to 2410 conditions per place. [2024-11-12 08:12:19,985 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 51 selfloop transitions, 26 changer transitions 40/135 dead transitions. [2024-11-12 08:12:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 135 transitions, 1292 flow [2024-11-12 08:12:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 08:12:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 08:12:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-11-12 08:12:19,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2024-11-12 08:12:19,987 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 584 flow. Second operand 9 states and 206 transitions. [2024-11-12 08:12:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 135 transitions, 1292 flow [2024-11-12 08:12:20,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 135 transitions, 1263 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-11-12 08:12:20,029 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 778 flow [2024-11-12 08:12:20,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-11-12 08:12:20,030 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-11-12 08:12:20,030 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 778 flow [2024-11-12 08:12:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 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-11-12 08:12:20,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:20,030 INFO L206 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, 1] [2024-11-12 08:12:20,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 08:12:20,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:20,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1633970883, now seen corresponding path program 1 times [2024-11-12 08:12:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:20,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656047381] [2024-11-12 08:12:20,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:20,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:20,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-11-12 08:12:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656047381] [2024-11-12 08:12:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656047381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 08:12:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770438666] [2024-11-12 08:12:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:12:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:20,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:12:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:12:20,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:20,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 778 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-11-12 08:12:20,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:20,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:20,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:21,264 INFO L124 PetriNetUnfolderBase]: 4950/7671 cut-off events. [2024-11-12 08:12:21,265 INFO L125 PetriNetUnfolderBase]: For 69370/70214 co-relation queries the response was YES. [2024-11-12 08:12:21,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38320 conditions, 7671 events. 4950/7671 cut-off events. For 69370/70214 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 48872 event pairs, 507 based on Foata normal form. 894/8407 useless extension candidates. Maximal degree in co-relation 38285. Up to 3740 conditions per place. [2024-11-12 08:12:21,316 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 115 selfloop transitions, 5 changer transitions 33/172 dead transitions. [2024-11-12 08:12:21,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 172 transitions, 2154 flow [2024-11-12 08:12:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:12:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:12:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-12 08:12:21,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2024-11-12 08:12:21,321 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 778 flow. Second operand 4 states and 109 transitions. [2024-11-12 08:12:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 172 transitions, 2154 flow [2024-11-12 08:12:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 172 transitions, 2000 flow, removed 64 selfloop flow, removed 6 redundant places. [2024-11-12 08:12:21,403 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 744 flow [2024-11-12 08:12:21,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=744, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2024-11-12 08:12:21,404 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-12 08:12:21,404 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 744 flow [2024-11-12 08:12:21,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-11-12 08:12:21,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:21,404 INFO L206 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, 1, 1] [2024-11-12 08:12:21,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 08:12:21,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:21,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 759580609, now seen corresponding path program 1 times [2024-11-12 08:12:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287035917] [2024-11-12 08:12:21,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:21,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287035917] [2024-11-12 08:12:21,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287035917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:21,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:21,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:12:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680641383] [2024-11-12 08:12:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:21,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:12:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:12:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:12:21,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:21,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 744 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-11-12 08:12:21,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:21,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:21,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:22,338 INFO L124 PetriNetUnfolderBase]: 3690/5835 cut-off events. [2024-11-12 08:12:22,339 INFO L125 PetriNetUnfolderBase]: For 39402/40043 co-relation queries the response was YES. [2024-11-12 08:12:22,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27754 conditions, 5835 events. 3690/5835 cut-off events. For 39402/40043 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 35997 event pairs, 345 based on Foata normal form. 722/6431 useless extension candidates. Maximal degree in co-relation 27721. Up to 2286 conditions per place. [2024-11-12 08:12:22,365 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 108 selfloop transitions, 8 changer transitions 26/161 dead transitions. [2024-11-12 08:12:22,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 161 transitions, 1819 flow [2024-11-12 08:12:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:12:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:12:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-11-12 08:12:22,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2024-11-12 08:12:22,369 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 744 flow. Second operand 5 states and 139 transitions. [2024-11-12 08:12:22,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 161 transitions, 1819 flow [2024-11-12 08:12:22,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 161 transitions, 1796 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-12 08:12:22,405 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 729 flow [2024-11-12 08:12:22,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2024-11-12 08:12:22,407 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2024-11-12 08:12:22,407 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 729 flow [2024-11-12 08:12:22,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-11-12 08:12:22,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:22,408 INFO L206 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, 1, 1, 1, 1, 1] [2024-11-12 08:12:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 08:12:22,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -397922807, now seen corresponding path program 1 times [2024-11-12 08:12:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232842623] [2024-11-12 08:12:22,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:22,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232842623] [2024-11-12 08:12:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232842623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:12:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961650008] [2024-11-12 08:12:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:12:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:12:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:12:22,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-12 08:12:22,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 729 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-11-12 08:12:22,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:22,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-12 08:12:22,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:23,320 INFO L124 PetriNetUnfolderBase]: 3108/4905 cut-off events. [2024-11-12 08:12:23,321 INFO L125 PetriNetUnfolderBase]: For 37582/38070 co-relation queries the response was YES. [2024-11-12 08:12:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24738 conditions, 4905 events. 3108/4905 cut-off events. For 37582/38070 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30086 event pairs, 342 based on Foata normal form. 509/5315 useless extension candidates. Maximal degree in co-relation 24703. Up to 2045 conditions per place. [2024-11-12 08:12:23,341 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 85 selfloop transitions, 11 changer transitions 33/147 dead transitions. [2024-11-12 08:12:23,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1594 flow [2024-11-12 08:12:23,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:12:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:12:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-12 08:12:23,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-11-12 08:12:23,343 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 729 flow. Second operand 6 states and 149 transitions. [2024-11-12 08:12:23,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1594 flow [2024-11-12 08:12:23,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1541 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-12 08:12:23,366 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 692 flow [2024-11-12 08:12:23,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-11-12 08:12:23,368 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2024-11-12 08:12:23,368 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 692 flow [2024-11-12 08:12:23,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 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-11-12 08:12:23,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:23,369 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 08:12:23,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1582005147, now seen corresponding path program 1 times [2024-11-12 08:12:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246683118] [2024-11-12 08:12:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:24,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246683118] [2024-11-12 08:12:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246683118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:24,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 08:12:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320367783] [2024-11-12 08:12:24,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:24,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 08:12:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 08:12:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 08:12:24,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:24,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 692 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:24,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:24,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:24,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:24,573 INFO L124 PetriNetUnfolderBase]: 1811/3435 cut-off events. [2024-11-12 08:12:24,574 INFO L125 PetriNetUnfolderBase]: For 15006/15325 co-relation queries the response was YES. [2024-11-12 08:12:24,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14474 conditions, 3435 events. 1811/3435 cut-off events. For 15006/15325 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 25119 event pairs, 533 based on Foata normal form. 125/3136 useless extension candidates. Maximal degree in co-relation 14438. Up to 1543 conditions per place. [2024-11-12 08:12:24,597 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 24 changer transitions 16/128 dead transitions. [2024-11-12 08:12:24,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1236 flow [2024-11-12 08:12:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 08:12:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 08:12:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 234 transitions. [2024-11-12 08:12:24,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188470066518847 [2024-11-12 08:12:24,599 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 692 flow. Second operand 11 states and 234 transitions. [2024-11-12 08:12:24,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1236 flow [2024-11-12 08:12:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 1132 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:24,635 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 840 flow [2024-11-12 08:12:24,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=840, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-11-12 08:12:24,636 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-11-12 08:12:24,636 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 840 flow [2024-11-12 08:12:24,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:24,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:24,637 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:24,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 08:12:24,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 534882887, now seen corresponding path program 2 times [2024-11-12 08:12:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771975655] [2024-11-12 08:12:24,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771975655] [2024-11-12 08:12:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771975655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 08:12:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274890929] [2024-11-12 08:12:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 08:12:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:25,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 08:12:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 08:12:25,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:25,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:25,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:25,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:26,251 INFO L124 PetriNetUnfolderBase]: 2279/4429 cut-off events. [2024-11-12 08:12:26,251 INFO L125 PetriNetUnfolderBase]: For 10192/10489 co-relation queries the response was YES. [2024-11-12 08:12:26,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16087 conditions, 4429 events. 2279/4429 cut-off events. For 10192/10489 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 34810 event pairs, 469 based on Foata normal form. 117/4080 useless extension candidates. Maximal degree in co-relation 16051. Up to 1783 conditions per place. [2024-11-12 08:12:26,277 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 51 selfloop transitions, 26 changer transitions 33/136 dead transitions. [2024-11-12 08:12:26,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 136 transitions, 1318 flow [2024-11-12 08:12:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-11-12 08:12:26,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2024-11-12 08:12:26,281 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 840 flow. Second operand 10 states and 226 transitions. [2024-11-12 08:12:26,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 136 transitions, 1318 flow [2024-11-12 08:12:26,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1279 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-12 08:12:26,294 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 917 flow [2024-11-12 08:12:26,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=917, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-11-12 08:12:26,295 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2024-11-12 08:12:26,295 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 917 flow [2024-11-12 08:12:26,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:26,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:26,295 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 08:12:26,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 165588499, now seen corresponding path program 3 times [2024-11-12 08:12:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:26,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420211296] [2024-11-12 08:12:26,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420211296] [2024-11-12 08:12:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420211296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582882937] [2024-11-12 08:12:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:27,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:27,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:27,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 917 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:27,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:27,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:28,479 INFO L124 PetriNetUnfolderBase]: 1937/3779 cut-off events. [2024-11-12 08:12:28,480 INFO L125 PetriNetUnfolderBase]: For 13270/13564 co-relation queries the response was YES. [2024-11-12 08:12:28,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15267 conditions, 3779 events. 1937/3779 cut-off events. For 13270/13564 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 28480 event pairs, 311 based on Foata normal form. 134/3552 useless extension candidates. Maximal degree in co-relation 15228. Up to 1394 conditions per place. [2024-11-12 08:12:28,505 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 62 selfloop transitions, 55 changer transitions 23/166 dead transitions. [2024-11-12 08:12:28,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 166 transitions, 1805 flow [2024-11-12 08:12:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 08:12:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 08:12:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 297 transitions. [2024-11-12 08:12:28,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174216027874564 [2024-11-12 08:12:28,510 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 917 flow. Second operand 14 states and 297 transitions. [2024-11-12 08:12:28,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 166 transitions, 1805 flow [2024-11-12 08:12:28,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 1641 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:28,543 INFO L231 Difference]: Finished difference. Result has 100 places, 116 transitions, 1232 flow [2024-11-12 08:12:28,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1232, PETRI_PLACES=100, PETRI_TRANSITIONS=116} [2024-11-12 08:12:28,544 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2024-11-12 08:12:28,544 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 116 transitions, 1232 flow [2024-11-12 08:12:28,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:28,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:28,545 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:28,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 08:12:28,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:28,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1770314009, now seen corresponding path program 4 times [2024-11-12 08:12:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085573298] [2024-11-12 08:12:28,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085573298] [2024-11-12 08:12:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085573298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 08:12:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116913147] [2024-11-12 08:12:29,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 08:12:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 08:12:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 08:12:29,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:29,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 116 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 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-11-12 08:12:29,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:29,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:29,967 INFO L124 PetriNetUnfolderBase]: 1818/3647 cut-off events. [2024-11-12 08:12:29,967 INFO L125 PetriNetUnfolderBase]: For 12205/12450 co-relation queries the response was YES. [2024-11-12 08:12:29,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 3647 events. 1818/3647 cut-off events. For 12205/12450 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 27855 event pairs, 318 based on Foata normal form. 114/3421 useless extension candidates. Maximal degree in co-relation 14416. Up to 1903 conditions per place. [2024-11-12 08:12:29,991 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 28 changer transitions 22/141 dead transitions. [2024-11-12 08:12:29,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 1595 flow [2024-11-12 08:12:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 08:12:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 08:12:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-11-12 08:12:29,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5213414634146342 [2024-11-12 08:12:29,993 INFO L175 Difference]: Start difference. First operand has 100 places, 116 transitions, 1232 flow. Second operand 8 states and 171 transitions. [2024-11-12 08:12:29,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 141 transitions, 1595 flow [2024-11-12 08:12:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 141 transitions, 1486 flow, removed 28 selfloop flow, removed 8 redundant places. [2024-11-12 08:12:30,018 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 1161 flow [2024-11-12 08:12:30,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-11-12 08:12:30,018 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-11-12 08:12:30,019 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 1161 flow [2024-11-12 08:12:30,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 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-11-12 08:12:30,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:30,019 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:30,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 08:12:30,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:30,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash -611692111, now seen corresponding path program 5 times [2024-11-12 08:12:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835966785] [2024-11-12 08:12:30,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:30,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:30,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835966785] [2024-11-12 08:12:30,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835966785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:30,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:30,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652299268] [2024-11-12 08:12:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:30,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:30,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:30,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 1161 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:30,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:30,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:30,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:31,429 INFO L124 PetriNetUnfolderBase]: 2209/4406 cut-off events. [2024-11-12 08:12:31,429 INFO L125 PetriNetUnfolderBase]: For 15429/15677 co-relation queries the response was YES. [2024-11-12 08:12:31,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16941 conditions, 4406 events. 2209/4406 cut-off events. For 15429/15677 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35308 event pairs, 746 based on Foata normal form. 140/4042 useless extension candidates. Maximal degree in co-relation 16905. Up to 2272 conditions per place. [2024-11-12 08:12:31,460 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 71 selfloop transitions, 25 changer transitions 26/148 dead transitions. [2024-11-12 08:12:31,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 148 transitions, 1649 flow [2024-11-12 08:12:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-12 08:12:31,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-11-12 08:12:31,461 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 1161 flow. Second operand 10 states and 214 transitions. [2024-11-12 08:12:31,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 148 transitions, 1649 flow [2024-11-12 08:12:31,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 148 transitions, 1613 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-11-12 08:12:31,486 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 1236 flow [2024-11-12 08:12:31,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1236, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2024-11-12 08:12:31,487 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2024-11-12 08:12:31,488 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 1236 flow [2024-11-12 08:12:31,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:31,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:31,488 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:31,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 08:12:31,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash -967362017, now seen corresponding path program 6 times [2024-11-12 08:12:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693168989] [2024-11-12 08:12:31,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693168989] [2024-11-12 08:12:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693168989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 08:12:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355782395] [2024-11-12 08:12:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 08:12:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 08:12:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 08:12:32,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:32,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 1236 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:32,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:32,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:32,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:32,908 INFO L124 PetriNetUnfolderBase]: 2152/4254 cut-off events. [2024-11-12 08:12:32,908 INFO L125 PetriNetUnfolderBase]: For 14268/14505 co-relation queries the response was YES. [2024-11-12 08:12:32,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16214 conditions, 4254 events. 2152/4254 cut-off events. For 14268/14505 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 33851 event pairs, 656 based on Foata normal form. 119/3878 useless extension candidates. Maximal degree in co-relation 16176. Up to 2000 conditions per place. [2024-11-12 08:12:32,981 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 65 selfloop transitions, 36 changer transitions 16/143 dead transitions. [2024-11-12 08:12:32,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1626 flow [2024-11-12 08:12:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2024-11-12 08:12:32,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5219512195121951 [2024-11-12 08:12:32,982 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 1236 flow. Second operand 10 states and 214 transitions. [2024-11-12 08:12:32,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1626 flow [2024-11-12 08:12:32,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 1591 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-12 08:12:32,999 INFO L231 Difference]: Finished difference. Result has 105 places, 116 transitions, 1363 flow [2024-11-12 08:12:32,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1363, PETRI_PLACES=105, PETRI_TRANSITIONS=116} [2024-11-12 08:12:33,000 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-12 08:12:33,000 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 1363 flow [2024-11-12 08:12:33,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:33,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:33,000 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:33,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 08:12:33,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:33,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1923076375, now seen corresponding path program 7 times [2024-11-12 08:12:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:33,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418868873] [2024-11-12 08:12:33,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418868873] [2024-11-12 08:12:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418868873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 08:12:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588335155] [2024-11-12 08:12:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 08:12:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 08:12:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 08:12:34,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:34,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 1363 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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-11-12 08:12:34,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:34,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:34,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:34,949 INFO L124 PetriNetUnfolderBase]: 2166/4339 cut-off events. [2024-11-12 08:12:34,949 INFO L125 PetriNetUnfolderBase]: For 17719/17977 co-relation queries the response was YES. [2024-11-12 08:12:34,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17253 conditions, 4339 events. 2166/4339 cut-off events. For 17719/17977 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 34742 event pairs, 604 based on Foata normal form. 122/4005 useless extension candidates. Maximal degree in co-relation 17214. Up to 2022 conditions per place. [2024-11-12 08:12:34,979 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 66 selfloop transitions, 41 changer transitions 14/147 dead transitions. [2024-11-12 08:12:34,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1761 flow [2024-11-12 08:12:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 08:12:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 08:12:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions. [2024-11-12 08:12:34,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144124168514412 [2024-11-12 08:12:34,981 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 1363 flow. Second operand 11 states and 232 transitions. [2024-11-12 08:12:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1761 flow [2024-11-12 08:12:35,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 147 transitions, 1703 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-12 08:12:35,007 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 1513 flow [2024-11-12 08:12:35,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1513, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2024-11-12 08:12:35,008 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 63 predicate places. [2024-11-12 08:12:35,008 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 1513 flow [2024-11-12 08:12:35,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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-11-12 08:12:35,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:35,009 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 08:12:35,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:35,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:35,010 INFO L85 PathProgramCache]: Analyzing trace with hash -863727337, now seen corresponding path program 8 times [2024-11-12 08:12:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653138414] [2024-11-12 08:12:35,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653138414] [2024-11-12 08:12:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653138414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:35,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 08:12:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570624305] [2024-11-12 08:12:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 08:12:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 08:12:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 08:12:35,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:35,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 1513 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:35,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:35,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:35,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:36,241 INFO L124 PetriNetUnfolderBase]: 2142/4400 cut-off events. [2024-11-12 08:12:36,241 INFO L125 PetriNetUnfolderBase]: For 22350/22566 co-relation queries the response was YES. [2024-11-12 08:12:36,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17967 conditions, 4400 events. 2142/4400 cut-off events. For 22350/22566 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 35978 event pairs, 785 based on Foata normal form. 101/4071 useless extension candidates. Maximal degree in co-relation 17926. Up to 2471 conditions per place. [2024-11-12 08:12:36,271 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 69 selfloop transitions, 21 changer transitions 31/147 dead transitions. [2024-11-12 08:12:36,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 147 transitions, 1880 flow [2024-11-12 08:12:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2024-11-12 08:12:36,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097560975609756 [2024-11-12 08:12:36,272 INFO L175 Difference]: Start difference. First operand has 110 places, 120 transitions, 1513 flow. Second operand 10 states and 209 transitions. [2024-11-12 08:12:36,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 147 transitions, 1880 flow [2024-11-12 08:12:36,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 1827 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-12 08:12:36,301 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 1427 flow [2024-11-12 08:12:36,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1427, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2024-11-12 08:12:36,302 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-11-12 08:12:36,302 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 1427 flow [2024-11-12 08:12:36,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-11-12 08:12:36,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:36,303 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:36,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 08:12:36,303 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 987910765, now seen corresponding path program 9 times [2024-11-12 08:12:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171382354] [2024-11-12 08:12:36,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171382354] [2024-11-12 08:12:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171382354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 08:12:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926499176] [2024-11-12 08:12:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 08:12:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 08:12:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 08:12:37,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:37,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 1427 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:37,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:37,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:37,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:37,854 INFO L124 PetriNetUnfolderBase]: 2249/4505 cut-off events. [2024-11-12 08:12:37,854 INFO L125 PetriNetUnfolderBase]: For 22763/23088 co-relation queries the response was YES. [2024-11-12 08:12:37,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 4505 events. 2249/4505 cut-off events. For 22763/23088 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 36852 event pairs, 576 based on Foata normal form. 156/4155 useless extension candidates. Maximal degree in co-relation 18342. Up to 2198 conditions per place. [2024-11-12 08:12:37,887 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 70 selfloop transitions, 27 changer transitions 22/145 dead transitions. [2024-11-12 08:12:37,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 145 transitions, 1860 flow [2024-11-12 08:12:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-11-12 08:12:37,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5292682926829269 [2024-11-12 08:12:37,888 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 1427 flow. Second operand 10 states and 217 transitions. [2024-11-12 08:12:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 145 transitions, 1860 flow [2024-11-12 08:12:37,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 1719 flow, removed 28 selfloop flow, removed 12 redundant places. [2024-11-12 08:12:37,929 INFO L231 Difference]: Finished difference. Result has 109 places, 108 transitions, 1349 flow [2024-11-12 08:12:37,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1349, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2024-11-12 08:12:37,930 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 62 predicate places. [2024-11-12 08:12:37,930 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1349 flow [2024-11-12 08:12:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:37,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:37,931 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 08:12:37,931 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash -924664551, now seen corresponding path program 10 times [2024-11-12 08:12:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047607347] [2024-11-12 08:12:37,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047607347] [2024-11-12 08:12:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047607347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684471480] [2024-11-12 08:12:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:38,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:38,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1349 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:38,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:38,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:38,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:39,250 INFO L124 PetriNetUnfolderBase]: 1974/4015 cut-off events. [2024-11-12 08:12:39,251 INFO L125 PetriNetUnfolderBase]: For 18376/18641 co-relation queries the response was YES. [2024-11-12 08:12:39,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15744 conditions, 4015 events. 1974/4015 cut-off events. For 18376/18641 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32156 event pairs, 628 based on Foata normal form. 122/3686 useless extension candidates. Maximal degree in co-relation 15703. Up to 2166 conditions per place. [2024-11-12 08:12:39,276 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 24 changer transitions 20/138 dead transitions. [2024-11-12 08:12:39,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 138 transitions, 1681 flow [2024-11-12 08:12:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 08:12:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 08:12:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions. [2024-11-12 08:12:39,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-11-12 08:12:39,277 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 1349 flow. Second operand 12 states and 248 transitions. [2024-11-12 08:12:39,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 138 transitions, 1681 flow [2024-11-12 08:12:39,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 138 transitions, 1607 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:39,304 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 1275 flow [2024-11-12 08:12:39,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1275, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-11-12 08:12:39,305 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 65 predicate places. [2024-11-12 08:12:39,305 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 1275 flow [2024-11-12 08:12:39,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:39,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:39,305 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 08:12:39,305 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:39,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash 260393961, now seen corresponding path program 11 times [2024-11-12 08:12:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330838145] [2024-11-12 08:12:39,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330838145] [2024-11-12 08:12:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330838145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 08:12:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204735668] [2024-11-12 08:12:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 08:12:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 08:12:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-12 08:12:40,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:40,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 1275 flow. Second operand has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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-11-12 08:12:40,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:40,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:40,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:40,968 INFO L124 PetriNetUnfolderBase]: 2245/4559 cut-off events. [2024-11-12 08:12:40,968 INFO L125 PetriNetUnfolderBase]: For 21141/21452 co-relation queries the response was YES. [2024-11-12 08:12:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17315 conditions, 4559 events. 2245/4559 cut-off events. For 21141/21452 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 37591 event pairs, 420 based on Foata normal form. 137/4225 useless extension candidates. Maximal degree in co-relation 17275. Up to 1952 conditions per place. [2024-11-12 08:12:40,996 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 65 selfloop transitions, 41 changer transitions 21/153 dead transitions. [2024-11-12 08:12:40,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 1793 flow [2024-11-12 08:12:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 08:12:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 08:12:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 296 transitions. [2024-11-12 08:12:41,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5156794425087108 [2024-11-12 08:12:41,000 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 1275 flow. Second operand 14 states and 296 transitions. [2024-11-12 08:12:41,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 153 transitions, 1793 flow [2024-11-12 08:12:41,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1704 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-12 08:12:41,026 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 1418 flow [2024-11-12 08:12:41,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1418, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-11-12 08:12:41,026 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 68 predicate places. [2024-11-12 08:12:41,027 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 1418 flow [2024-11-12 08:12:41,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.583333333333332) internal successors, (199), 12 states have internal predecessors, (199), 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-11-12 08:12:41,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:41,027 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:41,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 08:12:41,027 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:41,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash -439317001, now seen corresponding path program 12 times [2024-11-12 08:12:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:41,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623150565] [2024-11-12 08:12:41,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623150565] [2024-11-12 08:12:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623150565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:41,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 08:12:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942086470] [2024-11-12 08:12:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 08:12:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 08:12:41,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 08:12:41,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:41,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 1418 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:41,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:41,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:42,219 INFO L124 PetriNetUnfolderBase]: 2100/4326 cut-off events. [2024-11-12 08:12:42,219 INFO L125 PetriNetUnfolderBase]: For 20978/21266 co-relation queries the response was YES. [2024-11-12 08:12:42,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 4326 events. 2100/4326 cut-off events. For 20978/21266 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 35526 event pairs, 262 based on Foata normal form. 124/4086 useless extension candidates. Maximal degree in co-relation 17187. Up to 1595 conditions per place. [2024-11-12 08:12:42,248 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 62 selfloop transitions, 25 changer transitions 24/137 dead transitions. [2024-11-12 08:12:42,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 1778 flow [2024-11-12 08:12:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 08:12:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 08:12:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-12 08:12:42,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2024-11-12 08:12:42,249 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 1418 flow. Second operand 8 states and 176 transitions. [2024-11-12 08:12:42,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 1778 flow [2024-11-12 08:12:42,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 137 transitions, 1673 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-11-12 08:12:42,290 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1311 flow [2024-11-12 08:12:42,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1311, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2024-11-12 08:12:42,291 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-11-12 08:12:42,291 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1311 flow [2024-11-12 08:12:42,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-11-12 08:12:42,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:42,291 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 08:12:42,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:42,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -191134633, now seen corresponding path program 13 times [2024-11-12 08:12:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467011458] [2024-11-12 08:12:42,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467011458] [2024-11-12 08:12:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467011458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:42,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 08:12:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702709629] [2024-11-12 08:12:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 08:12:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 08:12:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 08:12:42,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:42,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 1311 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 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-11-12 08:12:42,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:42,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:42,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:43,323 INFO L124 PetriNetUnfolderBase]: 1919/3979 cut-off events. [2024-11-12 08:12:43,323 INFO L125 PetriNetUnfolderBase]: For 19133/19400 co-relation queries the response was YES. [2024-11-12 08:12:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15792 conditions, 3979 events. 1919/3979 cut-off events. For 19133/19400 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32369 event pairs, 372 based on Foata normal form. 117/3743 useless extension candidates. Maximal degree in co-relation 15750. Up to 1303 conditions per place. [2024-11-12 08:12:43,346 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 41 selfloop transitions, 27 changer transitions 36/130 dead transitions. [2024-11-12 08:12:43,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 130 transitions, 1641 flow [2024-11-12 08:12:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 08:12:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 08:12:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-11-12 08:12:43,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2024-11-12 08:12:43,347 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1311 flow. Second operand 9 states and 192 transitions. [2024-11-12 08:12:43,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 130 transitions, 1641 flow [2024-11-12 08:12:43,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 1497 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-11-12 08:12:43,375 INFO L231 Difference]: Finished difference. Result has 114 places, 84 transitions, 951 flow [2024-11-12 08:12:43,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=114, PETRI_TRANSITIONS=84} [2024-11-12 08:12:43,376 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 67 predicate places. [2024-11-12 08:12:43,376 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 84 transitions, 951 flow [2024-11-12 08:12:43,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 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-11-12 08:12:43,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:43,376 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:43,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 08:12:43,376 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -858683681, now seen corresponding path program 14 times [2024-11-12 08:12:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:43,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975043867] [2024-11-12 08:12:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975043867] [2024-11-12 08:12:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975043867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:43,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:43,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 08:12:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572910286] [2024-11-12 08:12:43,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:43,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 08:12:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 08:12:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 08:12:43,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2024-11-12 08:12:43,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 84 transitions, 951 flow. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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-11-12 08:12:43,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:43,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2024-11-12 08:12:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:44,379 INFO L124 PetriNetUnfolderBase]: 1921/3831 cut-off events. [2024-11-12 08:12:44,380 INFO L125 PetriNetUnfolderBase]: For 13863/14076 co-relation queries the response was YES. [2024-11-12 08:12:44,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14373 conditions, 3831 events. 1921/3831 cut-off events. For 13863/14076 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 30684 event pairs, 785 based on Foata normal form. 61/3417 useless extension candidates. Maximal degree in co-relation 14332. Up to 1908 conditions per place. [2024-11-12 08:12:44,396 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 47 selfloop transitions, 20 changer transitions 44/129 dead transitions. [2024-11-12 08:12:44,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 129 transitions, 1439 flow [2024-11-12 08:12:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2024-11-12 08:12:44,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-12 08:12:44,397 INFO L175 Difference]: Start difference. First operand has 114 places, 84 transitions, 951 flow. Second operand 10 states and 205 transitions. [2024-11-12 08:12:44,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 129 transitions, 1439 flow [2024-11-12 08:12:44,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 129 transitions, 1275 flow, removed 18 selfloop flow, removed 14 redundant places. [2024-11-12 08:12:44,415 INFO L231 Difference]: Finished difference. Result has 106 places, 79 transitions, 785 flow [2024-11-12 08:12:44,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=785, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2024-11-12 08:12:44,416 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2024-11-12 08:12:44,416 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 79 transitions, 785 flow [2024-11-12 08:12:44,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 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-11-12 08:12:44,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:44,416 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:44,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 08:12:44,416 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:44,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1528524445, now seen corresponding path program 15 times [2024-11-12 08:12:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462826664] [2024-11-12 08:12:44,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462826664] [2024-11-12 08:12:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462826664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:45,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386228706] [2024-11-12 08:12:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:45,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:45,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:45,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 79 transitions, 785 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:45,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:45,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:45,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:46,236 INFO L124 PetriNetUnfolderBase]: 839/1690 cut-off events. [2024-11-12 08:12:46,236 INFO L125 PetriNetUnfolderBase]: For 4365/4489 co-relation queries the response was YES. [2024-11-12 08:12:46,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 1690 events. 839/1690 cut-off events. For 4365/4489 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 11194 event pairs, 298 based on Foata normal form. 37/1527 useless extension candidates. Maximal degree in co-relation 5933. Up to 626 conditions per place. [2024-11-12 08:12:46,246 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 14 changer transitions 15/106 dead transitions. [2024-11-12 08:12:46,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 1039 flow [2024-11-12 08:12:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 08:12:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 08:12:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-11-12 08:12:46,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5055432372505543 [2024-11-12 08:12:46,247 INFO L175 Difference]: Start difference. First operand has 106 places, 79 transitions, 785 flow. Second operand 11 states and 228 transitions. [2024-11-12 08:12:46,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 1039 flow [2024-11-12 08:12:46,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 933 flow, removed 31 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:46,255 INFO L231 Difference]: Finished difference. Result has 105 places, 75 transitions, 675 flow [2024-11-12 08:12:46,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=675, PETRI_PLACES=105, PETRI_TRANSITIONS=75} [2024-11-12 08:12:46,255 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-12 08:12:46,255 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 75 transitions, 675 flow [2024-11-12 08:12:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:46,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:46,256 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:46,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 08:12:46,256 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1411096493, now seen corresponding path program 16 times [2024-11-12 08:12:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905184430] [2024-11-12 08:12:46,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:47,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905184430] [2024-11-12 08:12:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905184430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112141973] [2024-11-12 08:12:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:47,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:47,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:47,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 75 transitions, 675 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:47,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:47,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:47,696 INFO L124 PetriNetUnfolderBase]: 676/1367 cut-off events. [2024-11-12 08:12:47,696 INFO L125 PetriNetUnfolderBase]: For 2831/2929 co-relation queries the response was YES. [2024-11-12 08:12:47,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1367 events. 676/1367 cut-off events. For 2831/2929 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8601 event pairs, 97 based on Foata normal form. 32/1273 useless extension candidates. Maximal degree in co-relation 4715. Up to 603 conditions per place. [2024-11-12 08:12:47,705 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 37 selfloop transitions, 14 changer transitions 34/106 dead transitions. [2024-11-12 08:12:47,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 923 flow [2024-11-12 08:12:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 08:12:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 08:12:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 261 transitions. [2024-11-12 08:12:47,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896810506566604 [2024-11-12 08:12:47,707 INFO L175 Difference]: Start difference. First operand has 105 places, 75 transitions, 675 flow. Second operand 13 states and 261 transitions. [2024-11-12 08:12:47,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 923 flow [2024-11-12 08:12:47,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 833 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-12 08:12:47,714 INFO L231 Difference]: Finished difference. Result has 105 places, 57 transitions, 422 flow [2024-11-12 08:12:47,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=422, PETRI_PLACES=105, PETRI_TRANSITIONS=57} [2024-11-12 08:12:47,715 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 58 predicate places. [2024-11-12 08:12:47,715 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 57 transitions, 422 flow [2024-11-12 08:12:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:47,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:47,715 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:47,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 08:12:47,716 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:47,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -870970933, now seen corresponding path program 17 times [2024-11-12 08:12:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129698814] [2024-11-12 08:12:47,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:48,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:48,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129698814] [2024-11-12 08:12:48,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129698814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:48,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:48,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95521774] [2024-11-12 08:12:48,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:48,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:48,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:48,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:48,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 57 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:48,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:48,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:48,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:48,700 INFO L124 PetriNetUnfolderBase]: 555/1093 cut-off events. [2024-11-12 08:12:48,701 INFO L125 PetriNetUnfolderBase]: For 1611/1740 co-relation queries the response was YES. [2024-11-12 08:12:48,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1093 events. 555/1093 cut-off events. For 1611/1740 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6459 event pairs, 233 based on Foata normal form. 30/1002 useless extension candidates. Maximal degree in co-relation 3428. Up to 477 conditions per place. [2024-11-12 08:12:48,706 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 27 selfloop transitions, 8 changer transitions 25/80 dead transitions. [2024-11-12 08:12:48,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 80 transitions, 602 flow [2024-11-12 08:12:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-11-12 08:12:48,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4951219512195122 [2024-11-12 08:12:48,708 INFO L175 Difference]: Start difference. First operand has 105 places, 57 transitions, 422 flow. Second operand 10 states and 203 transitions. [2024-11-12 08:12:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 80 transitions, 602 flow [2024-11-12 08:12:48,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 483 flow, removed 16 selfloop flow, removed 22 redundant places. [2024-11-12 08:12:48,712 INFO L231 Difference]: Finished difference. Result has 85 places, 50 transitions, 270 flow [2024-11-12 08:12:48,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=85, PETRI_TRANSITIONS=50} [2024-11-12 08:12:48,713 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-12 08:12:48,713 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 50 transitions, 270 flow [2024-11-12 08:12:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:48,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:48,713 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 08:12:48,713 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1325008493, now seen corresponding path program 18 times [2024-11-12 08:12:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690894241] [2024-11-12 08:12:48,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:50,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:50,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690894241] [2024-11-12 08:12:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690894241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 08:12:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409552315] [2024-11-12 08:12:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 08:12:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 08:12:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-12 08:12:50,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:50,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 50 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 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-11-12 08:12:50,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:50,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:50,481 INFO L124 PetriNetUnfolderBase]: 502/1001 cut-off events. [2024-11-12 08:12:50,481 INFO L125 PetriNetUnfolderBase]: For 690/816 co-relation queries the response was YES. [2024-11-12 08:12:50,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1001 events. 502/1001 cut-off events. For 690/816 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5787 event pairs, 106 based on Foata normal form. 27/935 useless extension candidates. Maximal degree in co-relation 2756. Up to 406 conditions per place. [2024-11-12 08:12:50,486 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 27 selfloop transitions, 8 changer transitions 19/74 dead transitions. [2024-11-12 08:12:50,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 454 flow [2024-11-12 08:12:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 08:12:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 08:12:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-11-12 08:12:50,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-11-12 08:12:50,487 INFO L175 Difference]: Start difference. First operand has 85 places, 50 transitions, 270 flow. Second operand 9 states and 186 transitions. [2024-11-12 08:12:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 454 flow [2024-11-12 08:12:50,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 403 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-11-12 08:12:50,489 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 226 flow [2024-11-12 08:12:50,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2024-11-12 08:12:50,490 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-12 08:12:50,490 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 226 flow [2024-11-12 08:12:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 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-11-12 08:12:50,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:50,490 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:50,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 08:12:50,491 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:50,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -685457811, now seen corresponding path program 19 times [2024-11-12 08:12:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972499882] [2024-11-12 08:12:50,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:50,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:51,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-11-12 08:12:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972499882] [2024-11-12 08:12:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972499882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:51,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905667113] [2024-11-12 08:12:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:51,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:51,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:51,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:51,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:51,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:51,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:51,594 INFO L124 PetriNetUnfolderBase]: 451/918 cut-off events. [2024-11-12 08:12:51,594 INFO L125 PetriNetUnfolderBase]: For 477/561 co-relation queries the response was YES. [2024-11-12 08:12:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 918 events. 451/918 cut-off events. For 477/561 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5295 event pairs, 85 based on Foata normal form. 23/862 useless extension candidates. Maximal degree in co-relation 2369. Up to 383 conditions per place. [2024-11-12 08:12:51,597 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 25 selfloop transitions, 4 changer transitions 24/73 dead transitions. [2024-11-12 08:12:51,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 402 flow [2024-11-12 08:12:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 08:12:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 08:12:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2024-11-12 08:12:51,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4902439024390244 [2024-11-12 08:12:51,598 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 226 flow. Second operand 10 states and 201 transitions. [2024-11-12 08:12:51,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 402 flow [2024-11-12 08:12:51,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 378 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-11-12 08:12:51,600 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 211 flow [2024-11-12 08:12:51,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2024-11-12 08:12:51,601 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-12 08:12:51,601 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 211 flow [2024-11-12 08:12:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:51,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:51,602 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 08:12:51,602 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:51,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 130558385, now seen corresponding path program 20 times [2024-11-12 08:12:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13463211] [2024-11-12 08:12:51,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:51,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:12:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:12:52,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:12:52,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13463211] [2024-11-12 08:12:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13463211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:12:52,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:12:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 08:12:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145996302] [2024-11-12 08:12:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:12:52,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 08:12:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:12:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 08:12:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 08:12:52,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-12 08:12:52,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 211 flow. Second operand has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:52,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:12:52,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-12 08:12:52,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:12:52,917 INFO L124 PetriNetUnfolderBase]: 373/780 cut-off events. [2024-11-12 08:12:52,918 INFO L125 PetriNetUnfolderBase]: For 447/507 co-relation queries the response was YES. [2024-11-12 08:12:52,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 780 events. 373/780 cut-off events. For 447/507 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4286 event pairs, 71 based on Foata normal form. 19/741 useless extension candidates. Maximal degree in co-relation 2009. Up to 290 conditions per place. [2024-11-12 08:12:52,921 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 26 selfloop transitions, 6 changer transitions 20/72 dead transitions. [2024-11-12 08:12:52,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 389 flow [2024-11-12 08:12:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 08:12:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 08:12:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2024-11-12 08:12:52,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4789356984478936 [2024-11-12 08:12:52,922 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 211 flow. Second operand 11 states and 216 transitions. [2024-11-12 08:12:52,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 389 flow [2024-11-12 08:12:52,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 367 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-12 08:12:52,925 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 205 flow [2024-11-12 08:12:52,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=205, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-11-12 08:12:52,926 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2024-11-12 08:12:52,926 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 205 flow [2024-11-12 08:12:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.727272727272727) internal successors, (184), 11 states have internal predecessors, (184), 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-11-12 08:12:52,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:12:52,927 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 08:12:52,927 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 08:12:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:12:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1150557169, now seen corresponding path program 21 times [2024-11-12 08:12:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:12:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660357381] [2024-11-12 08:12:52,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:12:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:12:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 08:12:52,983 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 08:12:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 08:12:53,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 08:12:53,083 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 08:12:53,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-12 08:12:53,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-12 08:12:53,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-12 08:12:53,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-12 08:12:53,088 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-12 08:12:53,089 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-12 08:12:53,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 08:12:53,089 INFO L421 BasicCegarLoop]: Path program histogram: [21, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:12:53,154 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 08:12:53,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 08:12:53,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:12:53 BasicIcfg [2024-11-12 08:12:53,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 08:12:53,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 08:12:53,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 08:12:53,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 08:12:53,160 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:12:10" (3/4) ... [2024-11-12 08:12:53,160 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 08:12:53,233 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 08:12:53,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 08:12:53,233 INFO L158 Benchmark]: Toolchain (without parser) took 44008.29ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.0MB in the beginning and 745.0MB in the end (delta: -646.0MB). Peak memory consumption was 604.2MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,233 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.46ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 119.2MB in the end (delta: -20.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.40ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 116.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: Boogie Preprocessor took 68.09ms. Allocated memory is still 169.9MB. Free memory was 116.4MB in the beginning and 111.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: RCFGBuilder took 762.30ms. Allocated memory is still 169.9MB. Free memory was 111.3MB in the beginning and 100.5MB in the end (delta: 10.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: TraceAbstraction took 42486.53ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.5MB in the beginning and 757.6MB in the end (delta: -658.1MB). Peak memory consumption was 590.5MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,234 INFO L158 Benchmark]: Witness Printer took 73.95ms. Allocated memory is still 1.4GB. Free memory was 757.6MB in the beginning and 745.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 08:12:53,235 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.46ms. Allocated memory is still 169.9MB. Free memory was 98.7MB in the beginning and 119.2MB in the end (delta: -20.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.40ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 116.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.09ms. Allocated memory is still 169.9MB. Free memory was 116.4MB in the beginning and 111.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 762.30ms. Allocated memory is still 169.9MB. Free memory was 111.3MB in the beginning and 100.5MB in the end (delta: 10.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42486.53ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.5MB in the beginning and 757.6MB in the end (delta: -658.1MB). Peak memory consumption was 590.5MB. Max. memory is 16.1GB. * Witness Printer took 73.95ms. Allocated memory is still 1.4GB. Free memory was 757.6MB in the beginning and 745.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.3s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1795 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 886 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6621 IncrementalHoareTripleChecker+Invalid, 7013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 85 mSDtfsCounter, 6621 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1513occurred in iteration=17, InterpolantAutomatonStates: 289, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 9426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 08:12:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE