./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_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.graphml --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:54:50,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:54:50,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:54:50,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:54:50,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:54:50,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:54:50,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:54:50,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:54:50,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:54:50,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:54:50,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:54:50,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:54:50,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:54:50,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:54:50,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:54:50,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:54:50,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:54:50,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:54:50,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:54:50,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:54:50,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:54:50,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:54:50,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:54:50,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:54:50,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:54:50,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:54:50,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:54:50,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:54:50,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:54:50,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:54:50,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:54:50,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:54:50,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:54:50,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:54:50,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:54:50,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:54:50,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:54:50,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:54:50,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:54:50,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:54:50,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:54:50,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:54:50,547 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:54:50,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:54:50,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:54:50,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:54:50,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:54:50,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:54:50,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:54:50,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:54:50,552 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:54:50,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:54:50,553 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:54:50,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:54:50,554 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:54:50,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:54:50,555 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:54:50,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:54:50,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:54:50,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:54:50,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:54:50,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:50,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:54:50,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:54:50,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:54:50,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:54:50,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:54:50,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:54:50,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:54:50,558 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:54:50,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:54:50,558 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:54:50,558 INFO L138 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.graphml 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:54:50,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:54:50,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:54:50,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:54:50,887 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:54:50,887 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:54:50,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:54:52,015 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:54:52,328 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:54:52,345 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:54:52,371 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46583f42/41113c1a29ee49cdbc94bf6693b8a6bd/FLAGd575aa795 [2023-08-30 16:54:52,390 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46583f42/41113c1a29ee49cdbc94bf6693b8a6bd [2023-08-30 16:54:52,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:54:52,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:54:52,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:52,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:54:52,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:54:52,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:52" (1/1) ... [2023-08-30 16:54:52,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1a3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:52, skipping insertion in model container [2023-08-30 16:54:52,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:54:52" (1/1) ... [2023-08-30 16:54:52,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:54:52,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:54:52,643 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-30 16:54:52,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:52,900 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:54:52,912 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-30 16:54:52,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:54:53,034 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:53,034 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:54:53,049 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:54:53,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53 WrapperNode [2023-08-30 16:54:53,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:54:53,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:53,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:54:53,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:54:53,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,107 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:54:53,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:54:53,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:54:53,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:54:53,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:54:53,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,134 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:54:53,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:54:53,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:54:53,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:54:53,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (1/1) ... [2023-08-30 16:54:53,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:54:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:54:53,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:54:53,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:54:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:54:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:54:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:54:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:54:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:54:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:54:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:54:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:54:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:54:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:54:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:54:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:54:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:54:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:54:53,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:54:53,232 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:54:53,349 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:54:53,351 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:54:53,786 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:54:53,997 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:54:53,997 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:54:54,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:54 BoogieIcfgContainer [2023-08-30 16:54:54,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:54:54,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:54:54,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:54:54,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:54:54,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:54:52" (1/3) ... [2023-08-30 16:54:54,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683421b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:54, skipping insertion in model container [2023-08-30 16:54:54,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:54:53" (2/3) ... [2023-08-30 16:54:54,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@683421b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:54:54, skipping insertion in model container [2023-08-30 16:54:54,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:54" (3/3) ... [2023-08-30 16:54:54,010 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:54:54,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:54:54,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:54:54,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:54:54,026 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:54:54,083 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:54:54,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:54:54,183 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:54:54,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:54,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:54:54,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:54:54,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-30 16:54:54,197 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:54:54,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:54:54,214 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:54:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-30 16:54:54,253 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:54:54,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:54,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:54:54,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-30 16:54:58,004 INFO L134 LiptonReduction]: Checked pairs total: 5337 [2023-08-30 16:54:58,004 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-30 16:54:58,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:54:58,022 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5d7a1e75, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:54:58,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:54:58,024 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:54:58,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:54:58,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:58,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:54:58,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:58,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash 537160, now seen corresponding path program 1 times [2023-08-30 16:54:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259712246] [2023-08-30 16:54:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:58,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:54:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:54:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:54:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259712246] [2023-08-30 16:54:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259712246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:54:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:54:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:54:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631671844] [2023-08-30 16:54:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:54:58,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:54:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:54:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:54:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:54:58,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-30 16:54:58,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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) [2023-08-30 16:54:58,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:54:58,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-30 16:54:58,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:54:58,798 INFO L130 PetriNetUnfolder]: 1079/1731 cut-off events. [2023-08-30 16:54:58,799 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:54:58,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3378 conditions, 1731 events. 1079/1731 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9152 event pairs, 173 based on Foata normal form. 0/1650 useless extension candidates. Maximal degree in co-relation 3367. Up to 1297 conditions per place. [2023-08-30 16:54:58,811 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-30 16:54:58,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 167 flow [2023-08-30 16:54:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:54:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:54:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-30 16:54:58,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-08-30 16:54:58,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-30 16:54:58,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-30 16:54:58,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:54:58,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-30 16:54:58,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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) [2023-08-30 16:54:58,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-08-30 16:54:58,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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) [2023-08-30 16:54:58,838 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 316 transitions. [2023-08-30 16:54:58,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 167 flow [2023-08-30 16:54:58,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:54:58,843 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-30 16:54:58,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-30 16:54:58,848 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-30 16:54:58,848 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-30 16:54:58,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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) [2023-08-30 16:54:58,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:54:58,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:54:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:54:58,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:54:58,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:54:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash 46376923, now seen corresponding path program 1 times [2023-08-30 16:54:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:54:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124536611] [2023-08-30 16:54:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:54:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:54:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:00,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:00,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124536611] [2023-08-30 16:55:00,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124536611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:00,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:00,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:00,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948520443] [2023-08-30 16:55:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:00,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:00,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 200 [2023-08-30 16:55:00,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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) [2023-08-30 16:55:00,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:00,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 200 [2023-08-30 16:55:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:00,421 INFO L130 PetriNetUnfolder]: 917/1488 cut-off events. [2023-08-30 16:55:00,422 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2023-08-30 16:55:00,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1488 events. 917/1488 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7549 event pairs, 166 based on Foata normal form. 80/1567 useless extension candidates. Maximal degree in co-relation 3042. Up to 1032 conditions per place. [2023-08-30 16:55:00,429 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 29 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2023-08-30 16:55:00,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 218 flow [2023-08-30 16:55:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:55:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:55:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2023-08-30 16:55:00,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471 [2023-08-30 16:55:00,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 471 transitions. [2023-08-30 16:55:00,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 471 transitions. [2023-08-30 16:55:00,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:00,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 471 transitions. [2023-08-30 16:55:00,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 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) [2023-08-30 16:55:00,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:00,441 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:00,442 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 5 states and 471 transitions. [2023-08-30 16:55:00,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 218 flow [2023-08-30 16:55:00,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:00,443 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 62 flow [2023-08-30 16:55:00,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-30 16:55:00,444 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-30 16:55:00,445 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 62 flow [2023-08-30 16:55:00,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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) [2023-08-30 16:55:00,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:00,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:00,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:55:00,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:00,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1437651358, now seen corresponding path program 1 times [2023-08-30 16:55:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211828340] [2023-08-30 16:55:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211828340] [2023-08-30 16:55:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211828340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820393665] [2023-08-30 16:55:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:01,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:01,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:01,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:01,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-30 16:55:01,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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) [2023-08-30 16:55:01,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:01,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-30 16:55:01,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:02,000 INFO L130 PetriNetUnfolder]: 1264/1925 cut-off events. [2023-08-30 16:55:02,000 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2023-08-30 16:55:02,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 1925 events. 1264/1925 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9512 event pairs, 180 based on Foata normal form. 89/2012 useless extension candidates. Maximal degree in co-relation 4286. Up to 1018 conditions per place. [2023-08-30 16:55:02,010 INFO L137 encePairwiseOnDemand]: 188/200 looper letters, 44 selfloop transitions, 16 changer transitions 31/92 dead transitions. [2023-08-30 16:55:02,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 92 transitions, 410 flow [2023-08-30 16:55:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:55:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:55:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2023-08-30 16:55:02,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627777777777778 [2023-08-30 16:55:02,014 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2023-08-30 16:55:02,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2023-08-30 16:55:02,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:02,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2023-08-30 16:55:02,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 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) [2023-08-30 16:55:02,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:02,020 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:02,020 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 62 flow. Second operand 9 states and 833 transitions. [2023-08-30 16:55:02,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 92 transitions, 410 flow [2023-08-30 16:55:02,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 92 transitions, 394 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:02,026 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 197 flow [2023-08-30 16:55:02,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-30 16:55:02,027 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-30 16:55:02,027 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 197 flow [2023-08-30 16:55:02,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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) [2023-08-30 16:55:02,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:02,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:02,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:55:02,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:02,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1763070310, now seen corresponding path program 2 times [2023-08-30 16:55:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:02,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107987677] [2023-08-30 16:55:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:02,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107987677] [2023-08-30 16:55:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107987677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:02,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:02,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333712178] [2023-08-30 16:55:02,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:02,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:02,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:02,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 200 [2023-08-30 16:55:02,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 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) [2023-08-30 16:55:02,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:02,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 200 [2023-08-30 16:55:02,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:03,145 INFO L130 PetriNetUnfolder]: 988/1557 cut-off events. [2023-08-30 16:55:03,146 INFO L131 PetriNetUnfolder]: For 2721/2740 co-relation queries the response was YES. [2023-08-30 16:55:03,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 1557 events. 988/1557 cut-off events. For 2721/2740 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7395 event pairs, 269 based on Foata normal form. 87/1637 useless extension candidates. Maximal degree in co-relation 6113. Up to 877 conditions per place. [2023-08-30 16:55:03,161 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 53 selfloop transitions, 6 changer transitions 4/66 dead transitions. [2023-08-30 16:55:03,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 494 flow [2023-08-30 16:55:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:55:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:55:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2023-08-30 16:55:03,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2023-08-30 16:55:03,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2023-08-30 16:55:03,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2023-08-30 16:55:03,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:03,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2023-08-30 16:55:03,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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) [2023-08-30 16:55:03,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:03,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:03,172 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 197 flow. Second operand 5 states and 465 transitions. [2023-08-30 16:55:03,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 494 flow [2023-08-30 16:55:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 479 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 16:55:03,182 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 229 flow [2023-08-30 16:55:03,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-30 16:55:03,184 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-30 16:55:03,184 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 229 flow [2023-08-30 16:55:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 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) [2023-08-30 16:55:03,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:03,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:03,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:55:03,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:03,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash -498871668, now seen corresponding path program 1 times [2023-08-30 16:55:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930565528] [2023-08-30 16:55:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:04,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930565528] [2023-08-30 16:55:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930565528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:04,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:04,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:55:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861741945] [2023-08-30 16:55:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:04,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:55:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:55:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:55:04,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 200 [2023-08-30 16:55:04,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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) [2023-08-30 16:55:04,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:04,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 200 [2023-08-30 16:55:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:04,771 INFO L130 PetriNetUnfolder]: 2370/3595 cut-off events. [2023-08-30 16:55:04,771 INFO L131 PetriNetUnfolder]: For 6034/6094 co-relation queries the response was YES. [2023-08-30 16:55:04,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14184 conditions, 3595 events. 2370/3595 cut-off events. For 6034/6094 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 18987 event pairs, 310 based on Foata normal form. 103/3667 useless extension candidates. Maximal degree in co-relation 14164. Up to 1702 conditions per place. [2023-08-30 16:55:04,802 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 53 selfloop transitions, 7 changer transitions 46/108 dead transitions. [2023-08-30 16:55:04,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 878 flow [2023-08-30 16:55:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:55:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:55:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 656 transitions. [2023-08-30 16:55:04,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2023-08-30 16:55:04,807 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 656 transitions. [2023-08-30 16:55:04,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 656 transitions. [2023-08-30 16:55:04,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:04,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 656 transitions. [2023-08-30 16:55:04,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 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) [2023-08-30 16:55:04,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:04,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:04,833 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 229 flow. Second operand 7 states and 656 transitions. [2023-08-30 16:55:04,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 878 flow [2023-08-30 16:55:04,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 108 transitions, 869 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:55:04,853 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 255 flow [2023-08-30 16:55:04,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 16:55:04,857 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-08-30 16:55:04,857 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 255 flow [2023-08-30 16:55:04,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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) [2023-08-30 16:55:04,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:04,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:04,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:55:04,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:04,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1658963784, now seen corresponding path program 1 times [2023-08-30 16:55:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:04,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363742459] [2023-08-30 16:55:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363742459] [2023-08-30 16:55:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363742459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:05,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:05,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:55:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16862503] [2023-08-30 16:55:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:05,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:55:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:05,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:55:05,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:55:05,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-30 16:55:05,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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) [2023-08-30 16:55:05,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:05,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-30 16:55:05,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:06,149 INFO L130 PetriNetUnfolder]: 1404/2188 cut-off events. [2023-08-30 16:55:06,150 INFO L131 PetriNetUnfolder]: For 8803/8804 co-relation queries the response was YES. [2023-08-30 16:55:06,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9290 conditions, 2188 events. 1404/2188 cut-off events. For 8803/8804 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11063 event pairs, 199 based on Foata normal form. 57/2229 useless extension candidates. Maximal degree in co-relation 9265. Up to 1032 conditions per place. [2023-08-30 16:55:06,164 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 40 selfloop transitions, 3 changer transitions 34/78 dead transitions. [2023-08-30 16:55:06,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 650 flow [2023-08-30 16:55:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2023-08-30 16:55:06,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46166666666666667 [2023-08-30 16:55:06,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2023-08-30 16:55:06,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2023-08-30 16:55:06,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:06,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2023-08-30 16:55:06,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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) [2023-08-30 16:55:06,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:06,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:06,170 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 255 flow. Second operand 6 states and 554 transitions. [2023-08-30 16:55:06,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 650 flow [2023-08-30 16:55:06,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 612 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-08-30 16:55:06,177 INFO L231 Difference]: Finished difference. Result has 52 places, 24 transitions, 161 flow [2023-08-30 16:55:06,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=52, PETRI_TRANSITIONS=24} [2023-08-30 16:55:06,178 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-08-30 16:55:06,178 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 24 transitions, 161 flow [2023-08-30 16:55:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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) [2023-08-30 16:55:06,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:06,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:55:06,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:06,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 655163844, now seen corresponding path program 1 times [2023-08-30 16:55:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022127010] [2023-08-30 16:55:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:06,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:06,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022127010] [2023-08-30 16:55:06,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022127010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:06,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:06,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:55:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509080976] [2023-08-30 16:55:06,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:06,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:55:06,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:06,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:55:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:55:07,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-30 16:55:07,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 24 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 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) [2023-08-30 16:55:07,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:07,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-30 16:55:07,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:07,362 INFO L130 PetriNetUnfolder]: 1031/1589 cut-off events. [2023-08-30 16:55:07,362 INFO L131 PetriNetUnfolder]: For 4120/4120 co-relation queries the response was YES. [2023-08-30 16:55:07,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6733 conditions, 1589 events. 1031/1589 cut-off events. For 4120/4120 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6972 event pairs, 161 based on Foata normal form. 36/1625 useless extension candidates. Maximal degree in co-relation 6708. Up to 753 conditions per place. [2023-08-30 16:55:07,372 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 38 selfloop transitions, 7 changer transitions 16/62 dead transitions. [2023-08-30 16:55:07,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 506 flow [2023-08-30 16:55:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2023-08-30 16:55:07,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558333333333333 [2023-08-30 16:55:07,374 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 547 transitions. [2023-08-30 16:55:07,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 547 transitions. [2023-08-30 16:55:07,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:07,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 547 transitions. [2023-08-30 16:55:07,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 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) [2023-08-30 16:55:07,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:07,378 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:07,378 INFO L175 Difference]: Start difference. First operand has 52 places, 24 transitions, 161 flow. Second operand 6 states and 547 transitions. [2023-08-30 16:55:07,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 506 flow [2023-08-30 16:55:07,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 437 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-30 16:55:07,384 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 177 flow [2023-08-30 16:55:07,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-08-30 16:55:07,385 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-08-30 16:55:07,385 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 177 flow [2023-08-30 16:55:07,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 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) [2023-08-30 16:55:07,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:07,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:07,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:55:07,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:07,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1958393894, now seen corresponding path program 2 times [2023-08-30 16:55:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796409596] [2023-08-30 16:55:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796409596] [2023-08-30 16:55:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796409596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:55:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199747747] [2023-08-30 16:55:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:07,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:55:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:55:07,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:55:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:55:08,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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) [2023-08-30 16:55:08,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:08,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:55:08,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:08,349 INFO L130 PetriNetUnfolder]: 712/1128 cut-off events. [2023-08-30 16:55:08,349 INFO L131 PetriNetUnfolder]: For 3094/3094 co-relation queries the response was YES. [2023-08-30 16:55:08,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 1128 events. 712/1128 cut-off events. For 3094/3094 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4620 event pairs, 86 based on Foata normal form. 36/1164 useless extension candidates. Maximal degree in co-relation 4694. Up to 677 conditions per place. [2023-08-30 16:55:08,362 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 39 selfloop transitions, 8 changer transitions 20/68 dead transitions. [2023-08-30 16:55:08,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 547 flow [2023-08-30 16:55:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:55:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:55:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2023-08-30 16:55:08,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48714285714285716 [2023-08-30 16:55:08,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2023-08-30 16:55:08,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2023-08-30 16:55:08,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:08,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2023-08-30 16:55:08,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 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) [2023-08-30 16:55:08,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:08,371 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:08,371 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 177 flow. Second operand 7 states and 682 transitions. [2023-08-30 16:55:08,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 547 flow [2023-08-30 16:55:08,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 512 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-30 16:55:08,376 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 208 flow [2023-08-30 16:55:08,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-08-30 16:55:08,378 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-08-30 16:55:08,378 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 208 flow [2023-08-30 16:55:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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) [2023-08-30 16:55:08,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:08,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:55:08,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:08,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2078620821, now seen corresponding path program 1 times [2023-08-30 16:55:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538941962] [2023-08-30 16:55:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538941962] [2023-08-30 16:55:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538941962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:55:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660188040] [2023-08-30 16:55:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:09,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:55:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:55:09,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:55:09,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:55:09,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 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) [2023-08-30 16:55:09,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:09,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:55:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:09,641 INFO L130 PetriNetUnfolder]: 748/1184 cut-off events. [2023-08-30 16:55:09,641 INFO L131 PetriNetUnfolder]: For 4175/4175 co-relation queries the response was YES. [2023-08-30 16:55:09,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 1184 events. 748/1184 cut-off events. For 4175/4175 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4919 event pairs, 88 based on Foata normal form. 24/1208 useless extension candidates. Maximal degree in co-relation 5109. Up to 565 conditions per place. [2023-08-30 16:55:09,649 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 44 selfloop transitions, 10 changer transitions 18/73 dead transitions. [2023-08-30 16:55:09,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 600 flow [2023-08-30 16:55:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:55:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:55:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 776 transitions. [2023-08-30 16:55:09,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2023-08-30 16:55:09,653 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 776 transitions. [2023-08-30 16:55:09,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 776 transitions. [2023-08-30 16:55:09,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:09,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 776 transitions. [2023-08-30 16:55:09,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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) [2023-08-30 16:55:09,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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) [2023-08-30 16:55:09,658 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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) [2023-08-30 16:55:09,658 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 208 flow. Second operand 8 states and 776 transitions. [2023-08-30 16:55:09,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 600 flow [2023-08-30 16:55:09,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 567 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-30 16:55:09,664 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 236 flow [2023-08-30 16:55:09,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-30 16:55:09,665 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-08-30 16:55:09,666 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 236 flow [2023-08-30 16:55:09,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 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) [2023-08-30 16:55:09,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:09,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:09,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:55:09,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:09,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1906845915, now seen corresponding path program 1 times [2023-08-30 16:55:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518698694] [2023-08-30 16:55:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518698694] [2023-08-30 16:55:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518698694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:55:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932878636] [2023-08-30 16:55:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:11,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:55:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:55:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:55:11,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-30 16:55:11,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 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) [2023-08-30 16:55:11,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:11,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-30 16:55:11,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:11,849 INFO L130 PetriNetUnfolder]: 498/811 cut-off events. [2023-08-30 16:55:11,849 INFO L131 PetriNetUnfolder]: For 3580/3580 co-relation queries the response was YES. [2023-08-30 16:55:11,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 811 events. 498/811 cut-off events. For 3580/3580 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3054 event pairs, 241 based on Foata normal form. 27/838 useless extension candidates. Maximal degree in co-relation 3660. Up to 687 conditions per place. [2023-08-30 16:55:11,856 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 40 selfloop transitions, 7 changer transitions 11/59 dead transitions. [2023-08-30 16:55:11,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 527 flow [2023-08-30 16:55:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2023-08-30 16:55:11,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-30 16:55:11,858 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2023-08-30 16:55:11,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2023-08-30 16:55:11,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:11,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2023-08-30 16:55:11,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 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) [2023-08-30 16:55:11,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:11,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:11,863 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 236 flow. Second operand 6 states and 540 transitions. [2023-08-30 16:55:11,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 527 flow [2023-08-30 16:55:11,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 484 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-30 16:55:11,869 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 252 flow [2023-08-30 16:55:11,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2023-08-30 16:55:11,871 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-08-30 16:55:11,871 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 252 flow [2023-08-30 16:55:11,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 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) [2023-08-30 16:55:11,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:11,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:11,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:55:11,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:11,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 525708399, now seen corresponding path program 2 times [2023-08-30 16:55:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:11,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221415241] [2023-08-30 16:55:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221415241] [2023-08-30 16:55:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221415241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:55:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928695333] [2023-08-30 16:55:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:12,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:55:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:55:12,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:55:12,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 16:55:12,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 252 flow. Second operand has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 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) [2023-08-30 16:55:12,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:12,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 16:55:12,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:12,809 INFO L130 PetriNetUnfolder]: 634/1024 cut-off events. [2023-08-30 16:55:12,810 INFO L131 PetriNetUnfolder]: For 4543/4543 co-relation queries the response was YES. [2023-08-30 16:55:12,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 1024 events. 634/1024 cut-off events. For 4543/4543 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4136 event pairs, 223 based on Foata normal form. 26/1050 useless extension candidates. Maximal degree in co-relation 4678. Up to 593 conditions per place. [2023-08-30 16:55:12,819 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 39 selfloop transitions, 12 changer transitions 31/83 dead transitions. [2023-08-30 16:55:12,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 765 flow [2023-08-30 16:55:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:55:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:55:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 840 transitions. [2023-08-30 16:55:12,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-30 16:55:12,823 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 840 transitions. [2023-08-30 16:55:12,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 840 transitions. [2023-08-30 16:55:12,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:12,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 840 transitions. [2023-08-30 16:55:12,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 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) [2023-08-30 16:55:12,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:12,828 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:12,828 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 252 flow. Second operand 9 states and 840 transitions. [2023-08-30 16:55:12,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 765 flow [2023-08-30 16:55:12,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 723 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:12,840 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 360 flow [2023-08-30 16:55:12,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-30 16:55:12,841 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2023-08-30 16:55:12,841 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 360 flow [2023-08-30 16:55:12,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.875) internal successors, (695), 8 states have internal predecessors, (695), 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) [2023-08-30 16:55:12,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:12,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:12,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:55:12,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:12,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1705767480, now seen corresponding path program 1 times [2023-08-30 16:55:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641599816] [2023-08-30 16:55:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641599816] [2023-08-30 16:55:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641599816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:55:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517551604] [2023-08-30 16:55:14,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:14,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:55:14,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:14,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:55:14,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:55:14,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 16:55:14,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 360 flow. Second operand has 9 states, 9 states have (on average 86.77777777777777) internal successors, (781), 9 states have internal predecessors, (781), 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) [2023-08-30 16:55:14,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:14,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 16:55:14,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:14,645 INFO L130 PetriNetUnfolder]: 707/1163 cut-off events. [2023-08-30 16:55:14,645 INFO L131 PetriNetUnfolder]: For 6961/6961 co-relation queries the response was YES. [2023-08-30 16:55:14,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5768 conditions, 1163 events. 707/1163 cut-off events. For 6961/6961 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5060 event pairs, 253 based on Foata normal form. 30/1193 useless extension candidates. Maximal degree in co-relation 5740. Up to 491 conditions per place. [2023-08-30 16:55:14,654 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 59 selfloop transitions, 14 changer transitions 12/86 dead transitions. [2023-08-30 16:55:14,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 843 flow [2023-08-30 16:55:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:55:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:55:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2023-08-30 16:55:14,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672222222222222 [2023-08-30 16:55:14,657 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2023-08-30 16:55:14,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2023-08-30 16:55:14,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:14,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2023-08-30 16:55:14,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 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) [2023-08-30 16:55:14,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:14,663 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:14,663 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 360 flow. Second operand 9 states and 841 transitions. [2023-08-30 16:55:14,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 843 flow [2023-08-30 16:55:14,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 709 flow, removed 59 selfloop flow, removed 9 redundant places. [2023-08-30 16:55:14,679 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 358 flow [2023-08-30 16:55:14,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=358, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-30 16:55:14,680 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2023-08-30 16:55:14,681 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 358 flow [2023-08-30 16:55:14,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.77777777777777) internal successors, (781), 9 states have internal predecessors, (781), 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) [2023-08-30 16:55:14,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:14,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:14,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:55:14,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:14,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 968823255, now seen corresponding path program 1 times [2023-08-30 16:55:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517312956] [2023-08-30 16:55:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517312956] [2023-08-30 16:55:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517312956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:55:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139907533] [2023-08-30 16:55:16,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:16,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:55:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:55:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:55:16,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-30 16:55:16,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 358 flow. Second operand has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 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) [2023-08-30 16:55:16,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:16,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-30 16:55:16,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:16,752 INFO L130 PetriNetUnfolder]: 834/1376 cut-off events. [2023-08-30 16:55:16,752 INFO L131 PetriNetUnfolder]: For 5663/5663 co-relation queries the response was YES. [2023-08-30 16:55:16,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 1376 events. 834/1376 cut-off events. For 5663/5663 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6436 event pairs, 198 based on Foata normal form. 30/1406 useless extension candidates. Maximal degree in co-relation 6039. Up to 832 conditions per place. [2023-08-30 16:55:16,760 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 38 selfloop transitions, 17 changer transitions 11/67 dead transitions. [2023-08-30 16:55:16,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 657 flow [2023-08-30 16:55:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:55:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:55:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 618 transitions. [2023-08-30 16:55:16,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44142857142857145 [2023-08-30 16:55:16,764 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 618 transitions. [2023-08-30 16:55:16,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 618 transitions. [2023-08-30 16:55:16,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:16,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 618 transitions. [2023-08-30 16:55:16,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 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) [2023-08-30 16:55:16,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:16,768 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:16,768 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 358 flow. Second operand 7 states and 618 transitions. [2023-08-30 16:55:16,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 657 flow [2023-08-30 16:55:16,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 629 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-30 16:55:16,781 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 463 flow [2023-08-30 16:55:16,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-08-30 16:55:16,782 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2023-08-30 16:55:16,782 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 463 flow [2023-08-30 16:55:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 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) [2023-08-30 16:55:16,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:16,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:16,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:55:16,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:16,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 102971865, now seen corresponding path program 2 times [2023-08-30 16:55:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:16,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370001176] [2023-08-30 16:55:16,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:16,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:18,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370001176] [2023-08-30 16:55:18,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370001176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:18,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:18,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:55:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310280115] [2023-08-30 16:55:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:55:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:55:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:55:18,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 16:55:18,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 463 flow. Second operand has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 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) [2023-08-30 16:55:18,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:18,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 16:55:18,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:19,423 INFO L130 PetriNetUnfolder]: 1071/1783 cut-off events. [2023-08-30 16:55:19,423 INFO L131 PetriNetUnfolder]: For 8982/8982 co-relation queries the response was YES. [2023-08-30 16:55:19,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 1783 events. 1071/1783 cut-off events. For 8982/8982 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9036 event pairs, 305 based on Foata normal form. 30/1813 useless extension candidates. Maximal degree in co-relation 8175. Up to 836 conditions per place. [2023-08-30 16:55:19,435 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 67 selfloop transitions, 22 changer transitions 20/110 dead transitions. [2023-08-30 16:55:19,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 110 transitions, 1168 flow [2023-08-30 16:55:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 16:55:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 16:55:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1222 transitions. [2023-08-30 16:55:19,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-08-30 16:55:19,439 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1222 transitions. [2023-08-30 16:55:19,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1222 transitions. [2023-08-30 16:55:19,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:19,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1222 transitions. [2023-08-30 16:55:19,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.0) internal successors, (1222), 13 states have internal predecessors, (1222), 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) [2023-08-30 16:55:19,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 200.0) internal successors, (2800), 14 states have internal predecessors, (2800), 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) [2023-08-30 16:55:19,447 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 200.0) internal successors, (2800), 14 states have internal predecessors, (2800), 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) [2023-08-30 16:55:19,447 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 463 flow. Second operand 13 states and 1222 transitions. [2023-08-30 16:55:19,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 110 transitions, 1168 flow [2023-08-30 16:55:19,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 110 transitions, 1132 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:19,464 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 649 flow [2023-08-30 16:55:19,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=649, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2023-08-30 16:55:19,465 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2023-08-30 16:55:19,466 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 649 flow [2023-08-30 16:55:19,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.6) internal successors, (886), 10 states have internal predecessors, (886), 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) [2023-08-30 16:55:19,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:19,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:19,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:55:19,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:19,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash 102965138, now seen corresponding path program 2 times [2023-08-30 16:55:19,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:19,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334069206] [2023-08-30 16:55:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334069206] [2023-08-30 16:55:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334069206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681373110] [2023-08-30 16:55:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:19,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:55:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:55:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:55:19,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:55:19,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 649 flow. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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) [2023-08-30 16:55:19,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:19,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:55:19,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:19,985 INFO L130 PetriNetUnfolder]: 702/1258 cut-off events. [2023-08-30 16:55:19,985 INFO L131 PetriNetUnfolder]: For 12321/12333 co-relation queries the response was YES. [2023-08-30 16:55:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 1258 events. 702/1258 cut-off events. For 12321/12333 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6785 event pairs, 172 based on Foata normal form. 153/1407 useless extension candidates. Maximal degree in co-relation 6091. Up to 855 conditions per place. [2023-08-30 16:55:19,993 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 57 selfloop transitions, 4 changer transitions 47/112 dead transitions. [2023-08-30 16:55:19,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 1668 flow [2023-08-30 16:55:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:55:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:55:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-30 16:55:19,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495 [2023-08-30 16:55:19,997 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-30 16:55:19,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-30 16:55:19,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:19,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-30 16:55:19,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 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) [2023-08-30 16:55:20,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:20,002 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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) [2023-08-30 16:55:20,002 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 649 flow. Second operand 5 states and 495 transitions. [2023-08-30 16:55:20,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 1668 flow [2023-08-30 16:55:20,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 1561 flow, removed 31 selfloop flow, removed 10 redundant places. [2023-08-30 16:55:20,019 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 537 flow [2023-08-30 16:55:20,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-08-30 16:55:20,019 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-08-30 16:55:20,020 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 537 flow [2023-08-30 16:55:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 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) [2023-08-30 16:55:20,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:20,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:55:20,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:20,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 87331344, now seen corresponding path program 1 times [2023-08-30 16:55:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534343785] [2023-08-30 16:55:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:20,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534343785] [2023-08-30 16:55:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534343785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:55:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047169989] [2023-08-30 16:55:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:20,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:55:20,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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) [2023-08-30 16:55:20,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:20,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:55:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:20,511 INFO L130 PetriNetUnfolder]: 365/737 cut-off events. [2023-08-30 16:55:20,511 INFO L131 PetriNetUnfolder]: For 7429/7437 co-relation queries the response was YES. [2023-08-30 16:55:20,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 737 events. 365/737 cut-off events. For 7429/7437 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3867 event pairs, 40 based on Foata normal form. 107/840 useless extension candidates. Maximal degree in co-relation 3965. Up to 390 conditions per place. [2023-08-30 16:55:20,516 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 57 selfloop transitions, 7 changer transitions 43/110 dead transitions. [2023-08-30 16:55:20,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 1574 flow [2023-08-30 16:55:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 591 transitions. [2023-08-30 16:55:20,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925 [2023-08-30 16:55:20,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 591 transitions. [2023-08-30 16:55:20,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 591 transitions. [2023-08-30 16:55:20,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:20,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 591 transitions. [2023-08-30 16:55:20,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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) [2023-08-30 16:55:20,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:20,524 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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) [2023-08-30 16:55:20,525 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 537 flow. Second operand 6 states and 591 transitions. [2023-08-30 16:55:20,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 1574 flow [2023-08-30 16:55:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 1552 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:20,534 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 497 flow [2023-08-30 16:55:20,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-08-30 16:55:20,535 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2023-08-30 16:55:20,536 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 497 flow [2023-08-30 16:55:20,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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) [2023-08-30 16:55:20,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:20,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:20,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:55:20,537 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:20,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 728455059, now seen corresponding path program 1 times [2023-08-30 16:55:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842227784] [2023-08-30 16:55:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842227784] [2023-08-30 16:55:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842227784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:22,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:55:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740032595] [2023-08-30 16:55:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:22,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:55:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:55:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:55:22,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 200 [2023-08-30 16:55:22,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 497 flow. Second operand has 10 states, 10 states have (on average 85.9) internal successors, (859), 10 states have internal predecessors, (859), 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) [2023-08-30 16:55:22,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:22,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 200 [2023-08-30 16:55:22,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:22,688 INFO L130 PetriNetUnfolder]: 233/507 cut-off events. [2023-08-30 16:55:22,688 INFO L131 PetriNetUnfolder]: For 3714/3714 co-relation queries the response was YES. [2023-08-30 16:55:22,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 507 events. 233/507 cut-off events. For 3714/3714 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2275 event pairs, 72 based on Foata normal form. 3/510 useless extension candidates. Maximal degree in co-relation 3060. Up to 295 conditions per place. [2023-08-30 16:55:22,692 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 70 selfloop transitions, 7 changer transitions 4/82 dead transitions. [2023-08-30 16:55:22,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 82 transitions, 978 flow [2023-08-30 16:55:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:55:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:55:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 813 transitions. [2023-08-30 16:55:22,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45166666666666666 [2023-08-30 16:55:22,695 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 813 transitions. [2023-08-30 16:55:22,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 813 transitions. [2023-08-30 16:55:22,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:22,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 813 transitions. [2023-08-30 16:55:22,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.33333333333333) internal successors, (813), 9 states have internal predecessors, (813), 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) [2023-08-30 16:55:22,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:22,699 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 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) [2023-08-30 16:55:22,699 INFO L175 Difference]: Start difference. First operand has 70 places, 44 transitions, 497 flow. Second operand 9 states and 813 transitions. [2023-08-30 16:55:22,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 82 transitions, 978 flow [2023-08-30 16:55:22,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 893 flow, removed 33 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:22,708 INFO L231 Difference]: Finished difference. Result has 75 places, 45 transitions, 493 flow [2023-08-30 16:55:22,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=493, PETRI_PLACES=75, PETRI_TRANSITIONS=45} [2023-08-30 16:55:22,709 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2023-08-30 16:55:22,709 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 45 transitions, 493 flow [2023-08-30 16:55:22,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.9) internal successors, (859), 10 states have internal predecessors, (859), 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) [2023-08-30 16:55:22,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:22,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:22,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:55:22,710 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:22,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -183505427, now seen corresponding path program 2 times [2023-08-30 16:55:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238169945] [2023-08-30 16:55:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238169945] [2023-08-30 16:55:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238169945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:55:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626703007] [2023-08-30 16:55:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:22,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:55:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:55:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:55:22,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-30 16:55:22,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 45 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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) [2023-08-30 16:55:22,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:22,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-30 16:55:22,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:23,125 INFO L130 PetriNetUnfolder]: 163/375 cut-off events. [2023-08-30 16:55:23,125 INFO L131 PetriNetUnfolder]: For 3099/3104 co-relation queries the response was YES. [2023-08-30 16:55:23,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 375 events. 163/375 cut-off events. For 3099/3104 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1706 event pairs, 25 based on Foata normal form. 35/407 useless extension candidates. Maximal degree in co-relation 2021. Up to 130 conditions per place. [2023-08-30 16:55:23,128 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 56 selfloop transitions, 10 changer transitions 14/83 dead transitions. [2023-08-30 16:55:23,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 1136 flow [2023-08-30 16:55:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:55:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:55:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-08-30 16:55:23,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-08-30 16:55:23,130 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-08-30 16:55:23,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-08-30 16:55:23,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:23,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-08-30 16:55:23,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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) [2023-08-30 16:55:23,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:23,140 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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) [2023-08-30 16:55:23,141 INFO L175 Difference]: Start difference. First operand has 75 places, 45 transitions, 493 flow. Second operand 7 states and 668 transitions. [2023-08-30 16:55:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 1136 flow [2023-08-30 16:55:23,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 1003 flow, removed 43 selfloop flow, removed 8 redundant places. [2023-08-30 16:55:23,148 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 449 flow [2023-08-30 16:55:23,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-08-30 16:55:23,149 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-08-30 16:55:23,149 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 449 flow [2023-08-30 16:55:23,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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) [2023-08-30 16:55:23,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:23,150 INFO L208 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] [2023-08-30 16:55:23,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:55:23,150 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:23,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1519014781, now seen corresponding path program 1 times [2023-08-30 16:55:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946157695] [2023-08-30 16:55:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946157695] [2023-08-30 16:55:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946157695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 16:55:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103376471] [2023-08-30 16:55:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 16:55:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 16:55:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-30 16:55:25,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-30 16:55:25,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 449 flow. Second operand has 11 states, 11 states have (on average 83.9090909090909) internal successors, (923), 11 states have internal predecessors, (923), 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) [2023-08-30 16:55:25,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:25,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-30 16:55:25,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:25,577 INFO L130 PetriNetUnfolder]: 151/337 cut-off events. [2023-08-30 16:55:25,577 INFO L131 PetriNetUnfolder]: For 1836/1836 co-relation queries the response was YES. [2023-08-30 16:55:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 337 events. 151/337 cut-off events. For 1836/1836 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1362 event pairs, 26 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1843. Up to 181 conditions per place. [2023-08-30 16:55:25,579 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 40 selfloop transitions, 6 changer transitions 32/79 dead transitions. [2023-08-30 16:55:25,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 824 flow [2023-08-30 16:55:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:55:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:55:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2023-08-30 16:55:25,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2023-08-30 16:55:25,585 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 710 transitions. [2023-08-30 16:55:25,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 710 transitions. [2023-08-30 16:55:25,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:25,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 710 transitions. [2023-08-30 16:55:25,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 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) [2023-08-30 16:55:25,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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) [2023-08-30 16:55:25,596 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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) [2023-08-30 16:55:25,597 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 449 flow. Second operand 8 states and 710 transitions. [2023-08-30 16:55:25,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 824 flow [2023-08-30 16:55:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 79 transitions, 687 flow, removed 48 selfloop flow, removed 8 redundant places. [2023-08-30 16:55:25,605 INFO L231 Difference]: Finished difference. Result has 74 places, 38 transitions, 311 flow [2023-08-30 16:55:25,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=74, PETRI_TRANSITIONS=38} [2023-08-30 16:55:25,606 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-08-30 16:55:25,606 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 38 transitions, 311 flow [2023-08-30 16:55:25,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.9090909090909) internal successors, (923), 11 states have internal predecessors, (923), 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) [2023-08-30 16:55:25,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:25,606 INFO L208 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] [2023-08-30 16:55:25,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:55:25,607 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:25,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash -827491401, now seen corresponding path program 2 times [2023-08-30 16:55:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420943803] [2023-08-30 16:55:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:25,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:55:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:25,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:55:25,759 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:55:25,760 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:55:25,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:55:25,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:55:25,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:55:25,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:55:25,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:55:25,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 16:55:25,765 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:25,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:55:25,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:55:25,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:55:25 BasicIcfg [2023-08-30 16:55:25,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:55:25,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:55:25,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:55:25,851 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:55:25,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:54:54" (3/4) ... [2023-08-30 16:55:25,853 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:55:25,945 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:55:25,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:55:25,946 INFO L158 Benchmark]: Toolchain (without parser) took 33551.73ms. Allocated memory was 86.0MB in the beginning and 526.4MB in the end (delta: 440.4MB). Free memory was 62.0MB in the beginning and 320.6MB in the end (delta: -258.5MB). Peak memory consumption was 184.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,946 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:55:25,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.96ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.35ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,947 INFO L158 Benchmark]: Boogie Preprocessor took 32.51ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,947 INFO L158 Benchmark]: RCFGBuilder took 860.43ms. Allocated memory is still 86.0MB. Free memory was 54.8MB in the beginning and 58.7MB in the end (delta: -3.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,948 INFO L158 Benchmark]: TraceAbstraction took 31846.70ms. Allocated memory was 86.0MB in the beginning and 526.4MB in the end (delta: 440.4MB). Free memory was 58.1MB in the beginning and 332.1MB in the end (delta: -274.0MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,948 INFO L158 Benchmark]: Witness Printer took 94.24ms. Allocated memory is still 526.4MB. Free memory was 332.1MB in the beginning and 320.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 16:55:25,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 40.4MB in the beginning and 40.4MB in the end (delta: 40.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.96ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 59.8MB in the end (delta: 2.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.35ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.51ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 54.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.43ms. Allocated memory is still 86.0MB. Free memory was 54.8MB in the beginning and 58.7MB in the end (delta: -3.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31846.70ms. Allocated memory was 86.0MB in the beginning and 526.4MB in the end (delta: 440.4MB). Free memory was 58.1MB in the beginning and 332.1MB in the end (delta: -274.0MB). Peak memory consumption was 165.9MB. Max. memory is 16.1GB. * Witness Printer took 94.24ms. Allocated memory is still 526.4MB. Free memory was 332.1MB in the beginning and 320.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1992, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1003, independent: 970, independent conditional: 0, independent unconditional: 970, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1992, independent: 842, independent conditional: 0, independent unconditional: 842, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1003, unknown conditional: 0, unknown unconditional: 1003] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-3, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-2, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 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: 31.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1296 mSDsluCounter, 1360 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1189 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3830 IncrementalHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 171 mSDtfsCounter, 3830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=649occurred in iteration=14, InterpolantAutomatonStates: 135, 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.7s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 4516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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! [2023-08-30 16:55:25,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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