./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/safe002_rmo.oepc.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 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:17:49,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:17:49,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:17:49,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:17:49,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:17:49,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:17:49,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:17:49,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:17:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:17:49,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:17:49,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:17:49,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:17:49,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:17:49,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:17:49,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:17:49,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:17:49,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:17:49,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:17:49,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:17:49,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:17:49,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:17:49,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:17:49,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:17:49,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:17:49,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:17:49,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:17:49,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:17:49,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:17:49,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:17:49,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:17:49,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:17:49,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:17:49,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:17:49,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:17:49,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:17:49,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:17:49,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:17:49,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:17:49,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:17:49,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:17:49,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:17:49,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:17:49,458 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:17:49,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:17:49,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:17:49,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:17:49,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:17:49,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:17:49,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:17:49,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:17:49,465 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:17:49,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:17:49,466 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:17:49,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:17:49,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:17:49,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:17:49,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:17:49,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:17:49,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:17:49,468 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:17:49,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:17:49,468 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:17:49,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:17:49,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:17:49,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:17:49,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:17:49,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:17:49,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:17:49,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:17:49,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:17:49,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:17:49,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:17:49,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:17:49,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:17:49,471 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:17:49,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:17:49,472 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:17:49,472 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 -> 303fb09b32b7ab2953a798b1c14f8a25fd3d0e1788678487baddbc8a976b0d5f 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 -> TOGETHER [2023-08-30 23:17:49,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:17:49,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:17:49,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:17:49,834 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:17:49,836 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:17:49,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-30 23:17:51,037 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:17:51,333 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:17:51,333 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-30 23:17:51,349 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce78839a/37deaffbd32e4272bbfe88b20a570dc8/FLAG4b5147bd4 [2023-08-30 23:17:51,363 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce78839a/37deaffbd32e4272bbfe88b20a570dc8 [2023-08-30 23:17:51,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:17:51,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:17:51,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:17:51,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:17:51,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:17:51,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:51,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d51c489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51, skipping insertion in model container [2023-08-30 23:17:51,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:51,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:17:51,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:17:51,593 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/safe002_rmo.oepc.i[993,1006] [2023-08-30 23:17:51,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:17:51,830 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:17:51,842 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/safe002_rmo.oepc.i[993,1006] [2023-08-30 23:17:51,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:17:51,904 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:17:51,904 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:17:51,910 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:17:51,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51 WrapperNode [2023-08-30 23:17:51,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:17:51,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:17:51,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:17:51,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:17:51,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:51,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:51,993 INFO L138 Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-30 23:17:51,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:17:51,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:17:51,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:17:51,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:17:52,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:17:52,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:17:52,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:17:52,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:17:52,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (1/1) ... [2023-08-30 23:17:52,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:17:52,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:17:52,094 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 23:17:52,109 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 23:17:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 23:17:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:17:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:17:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:17:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:17:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:17:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:17:52,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:17:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:17:52,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:17:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:17:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:17:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:17:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:17:52,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:17:52,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:17:52,141 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 23:17:52,316 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:17:52,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:17:52,812 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:17:53,109 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:17:53,110 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:17:53,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:53 BoogieIcfgContainer [2023-08-30 23:17:53,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:17:53,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:17:53,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:17:53,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:17:53,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:17:51" (1/3) ... [2023-08-30 23:17:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca61798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:17:53, skipping insertion in model container [2023-08-30 23:17:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:17:51" (2/3) ... [2023-08-30 23:17:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca61798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:17:53, skipping insertion in model container [2023-08-30 23:17:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:53" (3/3) ... [2023-08-30 23:17:53,124 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-08-30 23:17:53,131 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:17:53,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:17:53,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 23:17:53,141 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:17:53,216 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:17:53,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 23:17:53,324 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-30 23:17:53,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:17:53,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-30 23:17:53,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-08-30 23:17:53,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2023-08-30 23:17:53,339 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:17:53,362 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2023-08-30 23:17:53,366 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2023-08-30 23:17:53,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2023-08-30 23:17:53,410 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2023-08-30 23:17:53,411 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:17:53,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-30 23:17:53,414 INFO L119 LiptonReduction]: Number of co-enabled transitions 1212 [2023-08-30 23:18:00,787 INFO L134 LiptonReduction]: Checked pairs total: 3777 [2023-08-30 23:18:00,787 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-30 23:18:00,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:18:00,804 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;@91103e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:18:00,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 23:18:00,814 INFO L130 PetriNetUnfolder]: 1/20 cut-off events. [2023-08-30 23:18:00,814 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:18:00,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:00,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:00,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:00,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -378234055, now seen corresponding path program 1 times [2023-08-30 23:18:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:00,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657609676] [2023-08-30 23:18:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:01,118 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 23:18:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:01,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657609676] [2023-08-30 23:18:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657609676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:01,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:18:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605906463] [2023-08-30 23:18:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:01,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 23:18:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:01,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 23:18:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 23:18:01,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217 [2023-08-30 23:18:01,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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 23:18:01,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:01,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217 [2023-08-30 23:18:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:01,514 INFO L130 PetriNetUnfolder]: 511/808 cut-off events. [2023-08-30 23:18:01,514 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 23:18:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 808 events. 511/808 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3533 event pairs, 511 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1616. Up to 783 conditions per place. [2023-08-30 23:18:01,526 INFO L137 encePairwiseOnDemand]: 216/217 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-08-30 23:18:01,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 87 flow [2023-08-30 23:18:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 23:18:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 23:18:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-30 23:18:01,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2023-08-30 23:18:01,544 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-30 23:18:01,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-30 23:18:01,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:01,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-30 23:18:01,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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 23:18:01,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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 23:18:01,557 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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 23:18:01,559 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 245 transitions. [2023-08-30 23:18:01,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 87 flow [2023-08-30 23:18:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:18:01,563 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 48 flow [2023-08-30 23:18:01,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-30 23:18:01,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-08-30 23:18:01,568 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 48 flow [2023-08-30 23:18:01,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 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 23:18:01,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:01,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:18:01,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:01,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1159102893, now seen corresponding path program 1 times [2023-08-30 23:18:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777093046] [2023-08-30 23:18:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:02,026 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 23:18:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777093046] [2023-08-30 23:18:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777093046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:02,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:18:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461516037] [2023-08-30 23:18:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:02,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:18:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:18:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:18:02,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 217 [2023-08-30 23:18:02,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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 23:18:02,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:02,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 217 [2023-08-30 23:18:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:02,334 INFO L130 PetriNetUnfolder]: 521/872 cut-off events. [2023-08-30 23:18:02,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:18:02,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 872 events. 521/872 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4167 event pairs, 126 based on Foata normal form. 48/916 useless extension candidates. Maximal degree in co-relation 1720. Up to 556 conditions per place. [2023-08-30 23:18:02,339 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 23 selfloop transitions, 2 changer transitions 14/42 dead transitions. [2023-08-30 23:18:02,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 168 flow [2023-08-30 23:18:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:18:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:18:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-30 23:18:02,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493087557603686 [2023-08-30 23:18:02,342 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-30 23:18:02,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-30 23:18:02,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:02,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-30 23:18:02,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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 23:18:02,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:02,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:02,349 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 48 flow. Second operand 5 states and 596 transitions. [2023-08-30 23:18:02,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 168 flow [2023-08-30 23:18:02,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:18:02,350 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 60 flow [2023-08-30 23:18:02,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-08-30 23:18:02,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-30 23:18:02,351 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 60 flow [2023-08-30 23:18:02,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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 23:18:02,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:02,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:02,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:18:02,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:02,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1572468288, now seen corresponding path program 1 times [2023-08-30 23:18:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20731386] [2023-08-30 23:18:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:02,826 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 23:18:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20731386] [2023-08-30 23:18:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20731386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:18:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558433354] [2023-08-30 23:18:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:02,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:18:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:18:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:18:02,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 217 [2023-08-30 23:18:02,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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 23:18:02,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:02,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 217 [2023-08-30 23:18:02,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:03,099 INFO L130 PetriNetUnfolder]: 446/759 cut-off events. [2023-08-30 23:18:03,100 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2023-08-30 23:18:03,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 759 events. 446/759 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3612 event pairs, 143 based on Foata normal form. 36/791 useless extension candidates. Maximal degree in co-relation 1653. Up to 497 conditions per place. [2023-08-30 23:18:03,106 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 28 selfloop transitions, 2 changer transitions 13/46 dead transitions. [2023-08-30 23:18:03,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 205 flow [2023-08-30 23:18:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:18:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:18:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-30 23:18:03,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5576036866359447 [2023-08-30 23:18:03,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-30 23:18:03,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-30 23:18:03,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:03,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-30 23:18:03,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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 23:18:03,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:03,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:03,112 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 60 flow. Second operand 5 states and 605 transitions. [2023-08-30 23:18:03,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 205 flow [2023-08-30 23:18:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 195 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:03,116 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 64 flow [2023-08-30 23:18:03,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2023-08-30 23:18:03,118 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-30 23:18:03,120 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 64 flow [2023-08-30 23:18:03,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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 23:18:03,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:03,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:03,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:18:03,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:03,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1468824674, now seen corresponding path program 1 times [2023-08-30 23:18:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726532134] [2023-08-30 23:18:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:04,015 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 23:18:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726532134] [2023-08-30 23:18:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726532134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:04,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:18:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121675721] [2023-08-30 23:18:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:04,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:18:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:18:04,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:18:04,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2023-08-30 23:18:04,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 64 flow. Second operand has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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 23:18:04,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:04,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2023-08-30 23:18:04,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:04,552 INFO L130 PetriNetUnfolder]: 953/1469 cut-off events. [2023-08-30 23:18:04,553 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2023-08-30 23:18:04,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3530 conditions, 1469 events. 953/1469 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6778 event pairs, 200 based on Foata normal form. 40/1508 useless extension candidates. Maximal degree in co-relation 3522. Up to 633 conditions per place. [2023-08-30 23:18:04,560 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 32 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-08-30 23:18:04,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 268 flow [2023-08-30 23:18:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions. [2023-08-30 23:18:04,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145929339477726 [2023-08-30 23:18:04,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 670 transitions. [2023-08-30 23:18:04,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions. [2023-08-30 23:18:04,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:04,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions. [2023-08-30 23:18:04,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 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 23:18:04,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:04,573 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:04,573 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 64 flow. Second operand 6 states and 670 transitions. [2023-08-30 23:18:04,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 268 flow [2023-08-30 23:18:04,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 58 transitions, 254 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:04,580 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 90 flow [2023-08-30 23:18:04,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-08-30 23:18:04,582 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-30 23:18:04,582 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 90 flow [2023-08-30 23:18:04,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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 23:18:04,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:04,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:04,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:18:04,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:04,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1266193384, now seen corresponding path program 2 times [2023-08-30 23:18:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247021177] [2023-08-30 23:18:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:06,011 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 23:18:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247021177] [2023-08-30 23:18:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247021177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:18:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720023051] [2023-08-30 23:18:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:18:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:18:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:18:06,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2023-08-30 23:18:06,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 90 flow. Second operand has 9 states, 9 states have (on average 102.33333333333333) internal successors, (921), 9 states have internal predecessors, (921), 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 23:18:06,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:06,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2023-08-30 23:18:06,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:06,606 INFO L130 PetriNetUnfolder]: 609/979 cut-off events. [2023-08-30 23:18:06,607 INFO L131 PetriNetUnfolder]: For 677/677 co-relation queries the response was YES. [2023-08-30 23:18:06,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 979 events. 609/979 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4404 event pairs, 101 based on Foata normal form. 52/1030 useless extension candidates. Maximal degree in co-relation 2755. Up to 465 conditions per place. [2023-08-30 23:18:06,612 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 29 selfloop transitions, 4 changer transitions 33/67 dead transitions. [2023-08-30 23:18:06,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 377 flow [2023-08-30 23:18:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:18:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:18:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2023-08-30 23:18:06,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046082949308756 [2023-08-30 23:18:06,615 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 876 transitions. [2023-08-30 23:18:06,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 876 transitions. [2023-08-30 23:18:06,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:06,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 876 transitions. [2023-08-30 23:18:06,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 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 23:18:06,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 23:18:06,622 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 23:18:06,622 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 90 flow. Second operand 8 states and 876 transitions. [2023-08-30 23:18:06,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 377 flow [2023-08-30 23:18:06,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 360 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 23:18:06,628 INFO L231 Difference]: Finished difference. Result has 48 places, 23 transitions, 113 flow [2023-08-30 23:18:06,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=113, PETRI_PLACES=48, PETRI_TRANSITIONS=23} [2023-08-30 23:18:06,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-08-30 23:18:06,630 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 23 transitions, 113 flow [2023-08-30 23:18:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.33333333333333) internal successors, (921), 9 states have internal predecessors, (921), 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 23:18:06,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:06,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:06,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:18:06,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:06,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -615100251, now seen corresponding path program 1 times [2023-08-30 23:18:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033029248] [2023-08-30 23:18:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:07,676 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 23:18:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033029248] [2023-08-30 23:18:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033029248] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:07,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:18:07,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106318590] [2023-08-30 23:18:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:18:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:18:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:18:07,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 217 [2023-08-30 23:18:07,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 23 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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 23:18:07,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:07,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 217 [2023-08-30 23:18:07,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:08,044 INFO L130 PetriNetUnfolder]: 482/770 cut-off events. [2023-08-30 23:18:08,045 INFO L131 PetriNetUnfolder]: For 1109/1109 co-relation queries the response was YES. [2023-08-30 23:18:08,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 770 events. 482/770 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3107 event pairs, 301 based on Foata normal form. 24/793 useless extension candidates. Maximal degree in co-relation 2414. Up to 672 conditions per place. [2023-08-30 23:18:08,050 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 24 selfloop transitions, 7 changer transitions 10/42 dead transitions. [2023-08-30 23:18:08,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 277 flow [2023-08-30 23:18:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions. [2023-08-30 23:18:08,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510752688172043 [2023-08-30 23:18:08,054 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 665 transitions. [2023-08-30 23:18:08,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions. [2023-08-30 23:18:08,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:08,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions. [2023-08-30 23:18:08,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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 23:18:08,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:08,058 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:08,058 INFO L175 Difference]: Start difference. First operand has 48 places, 23 transitions, 113 flow. Second operand 6 states and 665 transitions. [2023-08-30 23:18:08,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 277 flow [2023-08-30 23:18:08,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 245 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-30 23:18:08,063 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 143 flow [2023-08-30 23:18:08,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-30 23:18:08,068 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2023-08-30 23:18:08,068 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 143 flow [2023-08-30 23:18:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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 23:18:08,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:08,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:08,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:18:08,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:08,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 947827019, now seen corresponding path program 2 times [2023-08-30 23:18:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163550531] [2023-08-30 23:18:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:09,228 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 23:18:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163550531] [2023-08-30 23:18:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163550531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:09,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:18:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149201411] [2023-08-30 23:18:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:18:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:18:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:18:09,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2023-08-30 23:18:09,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 143 flow. Second operand has 9 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 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 23:18:09,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:09,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2023-08-30 23:18:09,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:09,669 INFO L130 PetriNetUnfolder]: 511/817 cut-off events. [2023-08-30 23:18:09,669 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-08-30 23:18:09,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 817 events. 511/817 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3399 event pairs, 295 based on Foata normal form. 24/840 useless extension candidates. Maximal degree in co-relation 2808. Up to 681 conditions per place. [2023-08-30 23:18:09,675 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 25 selfloop transitions, 9 changer transitions 10/45 dead transitions. [2023-08-30 23:18:09,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 330 flow [2023-08-30 23:18:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-30 23:18:09,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969278033794163 [2023-08-30 23:18:09,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-30 23:18:09,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-30 23:18:09,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:09,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-30 23:18:09,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 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 23:18:09,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:09,682 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:09,682 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 143 flow. Second operand 6 states and 647 transitions. [2023-08-30 23:18:09,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 330 flow [2023-08-30 23:18:09,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 316 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 23:18:09,686 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 194 flow [2023-08-30 23:18:09,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=194, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-08-30 23:18:09,687 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-08-30 23:18:09,687 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 194 flow [2023-08-30 23:18:09,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 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 23:18:09,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:09,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:09,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:18:09,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:09,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash -196162235, now seen corresponding path program 3 times [2023-08-30 23:18:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274510529] [2023-08-30 23:18:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:10,952 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 23:18:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274510529] [2023-08-30 23:18:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274510529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:18:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232308309] [2023-08-30 23:18:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:10,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:18:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:18:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:18:11,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 217 [2023-08-30 23:18:11,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 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 23:18:11,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:11,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 217 [2023-08-30 23:18:11,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:11,342 INFO L130 PetriNetUnfolder]: 540/862 cut-off events. [2023-08-30 23:18:11,343 INFO L131 PetriNetUnfolder]: For 2810/2810 co-relation queries the response was YES. [2023-08-30 23:18:11,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 862 events. 540/862 cut-off events. For 2810/2810 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3610 event pairs, 318 based on Foata normal form. 24/885 useless extension candidates. Maximal degree in co-relation 3444. Up to 726 conditions per place. [2023-08-30 23:18:11,349 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 28 selfloop transitions, 9 changer transitions 10/48 dead transitions. [2023-08-30 23:18:11,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 412 flow [2023-08-30 23:18:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions. [2023-08-30 23:18:11,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510752688172043 [2023-08-30 23:18:11,352 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 665 transitions. [2023-08-30 23:18:11,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions. [2023-08-30 23:18:11,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:11,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions. [2023-08-30 23:18:11,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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 23:18:11,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:11,356 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:11,357 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 194 flow. Second operand 6 states and 665 transitions. [2023-08-30 23:18:11,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 412 flow [2023-08-30 23:18:11,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 364 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 23:18:11,362 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 230 flow [2023-08-30 23:18:11,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-30 23:18:11,363 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2023-08-30 23:18:11,363 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 230 flow [2023-08-30 23:18:11,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 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 23:18:11,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:11,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:11,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:18:11,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:11,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1041021619, now seen corresponding path program 4 times [2023-08-30 23:18:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:11,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262973238] [2023-08-30 23:18:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:11,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:12,337 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 23:18:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262973238] [2023-08-30 23:18:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262973238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:18:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611088039] [2023-08-30 23:18:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:12,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:18:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:18:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:18:12,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 217 [2023-08-30 23:18:12,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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 23:18:12,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:12,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 217 [2023-08-30 23:18:12,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:12,717 INFO L130 PetriNetUnfolder]: 607/968 cut-off events. [2023-08-30 23:18:12,717 INFO L131 PetriNetUnfolder]: For 3798/3798 co-relation queries the response was YES. [2023-08-30 23:18:12,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 968 events. 607/968 cut-off events. For 3798/3798 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4267 event pairs, 316 based on Foata normal form. 28/995 useless extension candidates. Maximal degree in co-relation 4071. Up to 785 conditions per place. [2023-08-30 23:18:12,726 INFO L137 encePairwiseOnDemand]: 209/217 looper letters, 32 selfloop transitions, 14 changer transitions 11/58 dead transitions. [2023-08-30 23:18:12,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 532 flow [2023-08-30 23:18:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-08-30 23:18:12,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153609831029186 [2023-08-30 23:18:12,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-08-30 23:18:12,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-08-30 23:18:12,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:12,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-08-30 23:18:12,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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 23:18:12,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:12,734 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:12,734 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 230 flow. Second operand 6 states and 671 transitions. [2023-08-30 23:18:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 532 flow [2023-08-30 23:18:12,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 487 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:12,741 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 357 flow [2023-08-30 23:18:12,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-30 23:18:12,742 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-08-30 23:18:12,742 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 357 flow [2023-08-30 23:18:12,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 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 23:18:12,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:12,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:12,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:18:12,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:12,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1041915349, now seen corresponding path program 5 times [2023-08-30 23:18:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770089184] [2023-08-30 23:18:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:12,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:14,213 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 23:18:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770089184] [2023-08-30 23:18:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770089184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 23:18:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528741888] [2023-08-30 23:18:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 23:18:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 23:18:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-30 23:18:14,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2023-08-30 23:18:14,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 103.4) internal successors, (1034), 10 states have internal predecessors, (1034), 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 23:18:14,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:14,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2023-08-30 23:18:14,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:14,828 INFO L130 PetriNetUnfolder]: 589/946 cut-off events. [2023-08-30 23:18:14,829 INFO L131 PetriNetUnfolder]: For 4181/4181 co-relation queries the response was YES. [2023-08-30 23:18:14,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 946 events. 589/946 cut-off events. For 4181/4181 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4185 event pairs, 302 based on Foata normal form. 24/969 useless extension candidates. Maximal degree in co-relation 4226. Up to 721 conditions per place. [2023-08-30 23:18:14,836 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 33 selfloop transitions, 17 changer transitions 10/61 dead transitions. [2023-08-30 23:18:14,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 639 flow [2023-08-30 23:18:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2023-08-30 23:18:14,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015360983102919 [2023-08-30 23:18:14,839 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2023-08-30 23:18:14,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2023-08-30 23:18:14,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:14,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2023-08-30 23:18:14,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 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 23:18:14,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:14,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:14,843 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 357 flow. Second operand 6 states and 653 transitions. [2023-08-30 23:18:14,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 639 flow [2023-08-30 23:18:14,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 597 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:14,855 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 439 flow [2023-08-30 23:18:14,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-30 23:18:14,857 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2023-08-30 23:18:14,857 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 439 flow [2023-08-30 23:18:14,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.4) internal successors, (1034), 10 states have internal predecessors, (1034), 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 23:18:14,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:14,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:14,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:18:14,858 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:14,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash -807083926, now seen corresponding path program 1 times [2023-08-30 23:18:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287751183] [2023-08-30 23:18:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:16,751 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 23:18:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287751183] [2023-08-30 23:18:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287751183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:18:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076762513] [2023-08-30 23:18:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:18:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:18:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:18:16,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217 [2023-08-30 23:18:16,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 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 23:18:16,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:16,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217 [2023-08-30 23:18:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:17,471 INFO L130 PetriNetUnfolder]: 763/1235 cut-off events. [2023-08-30 23:18:17,472 INFO L131 PetriNetUnfolder]: For 6579/6579 co-relation queries the response was YES. [2023-08-30 23:18:17,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1235 events. 763/1235 cut-off events. For 6579/6579 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6011 event pairs, 273 based on Foata normal form. 20/1254 useless extension candidates. Maximal degree in co-relation 5758. Up to 805 conditions per place. [2023-08-30 23:18:17,484 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 47 selfloop transitions, 18 changer transitions 12/78 dead transitions. [2023-08-30 23:18:17,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 833 flow [2023-08-30 23:18:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:18:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:18:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 870 transitions. [2023-08-30 23:18:17,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011520737327189 [2023-08-30 23:18:17,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 870 transitions. [2023-08-30 23:18:17,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 870 transitions. [2023-08-30 23:18:17,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:17,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 870 transitions. [2023-08-30 23:18:17,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 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 23:18:17,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 23:18:17,494 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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 23:18:17,494 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 439 flow. Second operand 8 states and 870 transitions. [2023-08-30 23:18:17,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 833 flow [2023-08-30 23:18:17,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 791 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:17,502 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 580 flow [2023-08-30 23:18:17,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-30 23:18:17,503 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2023-08-30 23:18:17,503 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 580 flow [2023-08-30 23:18:17,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 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 23:18:17,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:17,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:17,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:18:17,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:17,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1292294960, now seen corresponding path program 2 times [2023-08-30 23:18:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869748663] [2023-08-30 23:18:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:18,869 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 23:18:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869748663] [2023-08-30 23:18:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869748663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:18,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:18,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:18:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712639663] [2023-08-30 23:18:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:18:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:18:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:18:18,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217 [2023-08-30 23:18:18,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 580 flow. Second operand has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 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 23:18:18,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:18,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217 [2023-08-30 23:18:18,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:19,374 INFO L130 PetriNetUnfolder]: 739/1194 cut-off events. [2023-08-30 23:18:19,374 INFO L131 PetriNetUnfolder]: For 7723/7723 co-relation queries the response was YES. [2023-08-30 23:18:19,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 1194 events. 739/1194 cut-off events. For 7723/7723 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5725 event pairs, 267 based on Foata normal form. 16/1209 useless extension candidates. Maximal degree in co-relation 5679. Up to 786 conditions per place. [2023-08-30 23:18:19,385 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 45 selfloop transitions, 16 changer transitions 8/70 dead transitions. [2023-08-30 23:18:19,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 834 flow [2023-08-30 23:18:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:18:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:18:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2023-08-30 23:18:19,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023041474654378 [2023-08-30 23:18:19,388 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 654 transitions. [2023-08-30 23:18:19,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 654 transitions. [2023-08-30 23:18:19,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:19,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 654 transitions. [2023-08-30 23:18:19,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 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 23:18:19,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:19,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 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 23:18:19,393 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 580 flow. Second operand 6 states and 654 transitions. [2023-08-30 23:18:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 834 flow [2023-08-30 23:18:19,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 811 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-30 23:18:19,402 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 613 flow [2023-08-30 23:18:19,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=613, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-08-30 23:18:19,403 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2023-08-30 23:18:19,403 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 613 flow [2023-08-30 23:18:19,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 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 23:18:19,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:19,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:19,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:18:19,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:19,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 663065424, now seen corresponding path program 1 times [2023-08-30 23:18:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034814849] [2023-08-30 23:18:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:19,645 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 23:18:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034814849] [2023-08-30 23:18:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034814849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:18:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922006624] [2023-08-30 23:18:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:19,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:18:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:18:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:18:19,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 217 [2023-08-30 23:18:19,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 613 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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 23:18:19,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:19,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 217 [2023-08-30 23:18:19,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:19,926 INFO L130 PetriNetUnfolder]: 527/953 cut-off events. [2023-08-30 23:18:19,926 INFO L131 PetriNetUnfolder]: For 5739/5823 co-relation queries the response was YES. [2023-08-30 23:18:19,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 953 events. 527/953 cut-off events. For 5739/5823 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5171 event pairs, 74 based on Foata normal form. 170/1114 useless extension candidates. Maximal degree in co-relation 4217. Up to 559 conditions per place. [2023-08-30 23:18:19,937 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 91 selfloop transitions, 7 changer transitions 11/124 dead transitions. [2023-08-30 23:18:19,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 1461 flow [2023-08-30 23:18:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:18:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:18:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-08-30 23:18:19,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2023-08-30 23:18:19,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-08-30 23:18:19,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-08-30 23:18:19,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:19,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-08-30 23:18:19,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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 23:18:19,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:19,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:19,944 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 613 flow. Second operand 5 states and 589 transitions. [2023-08-30 23:18:19,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 1461 flow [2023-08-30 23:18:19,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 1413 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 23:18:19,953 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 631 flow [2023-08-30 23:18:19,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=631, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-08-30 23:18:19,954 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2023-08-30 23:18:19,954 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 631 flow [2023-08-30 23:18:19,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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 23:18:19,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:19,955 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 23:18:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:18:19,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:19,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2109874660, now seen corresponding path program 1 times [2023-08-30 23:18:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626240725] [2023-08-30 23:18:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:20,264 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 23:18:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:20,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626240725] [2023-08-30 23:18:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626240725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:20,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:18:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529661865] [2023-08-30 23:18:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:18:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:18:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:18:20,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 217 [2023-08-30 23:18:20,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 631 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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 23:18:20,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:20,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 217 [2023-08-30 23:18:20,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:20,557 INFO L130 PetriNetUnfolder]: 387/760 cut-off events. [2023-08-30 23:18:20,557 INFO L131 PetriNetUnfolder]: For 4273/4361 co-relation queries the response was YES. [2023-08-30 23:18:20,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3737 conditions, 760 events. 387/760 cut-off events. For 4273/4361 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4262 event pairs, 23 based on Foata normal form. 128/883 useless extension candidates. Maximal degree in co-relation 3716. Up to 280 conditions per place. [2023-08-30 23:18:20,571 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 96 selfloop transitions, 13 changer transitions 16/139 dead transitions. [2023-08-30 23:18:20,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 139 transitions, 1610 flow [2023-08-30 23:18:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:18:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:18:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-30 23:18:20,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5404871626069783 [2023-08-30 23:18:20,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-30 23:18:20,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-30 23:18:20,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:20,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-30 23:18:20,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 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 23:18:20,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 23:18:20,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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 23:18:20,581 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 631 flow. Second operand 7 states and 821 transitions. [2023-08-30 23:18:20,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 139 transitions, 1610 flow [2023-08-30 23:18:20,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 139 transitions, 1588 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-30 23:18:20,589 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 672 flow [2023-08-30 23:18:20,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-08-30 23:18:20,589 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2023-08-30 23:18:20,590 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 672 flow [2023-08-30 23:18:20,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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 23:18:20,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:20,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:18:20,591 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:20,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -479953228, now seen corresponding path program 1 times [2023-08-30 23:18:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953150033] [2023-08-30 23:18:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:20,885 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 23:18:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953150033] [2023-08-30 23:18:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953150033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:18:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737108222] [2023-08-30 23:18:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:20,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:18:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:20,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:18:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:18:20,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 217 [2023-08-30 23:18:20,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 672 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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 23:18:20,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:20,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 217 [2023-08-30 23:18:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:21,239 INFO L130 PetriNetUnfolder]: 708/1363 cut-off events. [2023-08-30 23:18:21,239 INFO L131 PetriNetUnfolder]: For 8249/8322 co-relation queries the response was YES. [2023-08-30 23:18:21,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7263 conditions, 1363 events. 708/1363 cut-off events. For 8249/8322 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8135 event pairs, 102 based on Foata normal form. 73/1425 useless extension candidates. Maximal degree in co-relation 7240. Up to 642 conditions per place. [2023-08-30 23:18:21,251 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 79 selfloop transitions, 2 changer transitions 20/114 dead transitions. [2023-08-30 23:18:21,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 1325 flow [2023-08-30 23:18:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:18:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:18:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-30 23:18:21,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373271889400921 [2023-08-30 23:18:21,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-30 23:18:21,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-30 23:18:21,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:21,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-30 23:18:21,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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 23:18:21,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:21,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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 23:18:21,257 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 672 flow. Second operand 5 states and 583 transitions. [2023-08-30 23:18:21,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 1325 flow [2023-08-30 23:18:21,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 1260 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-30 23:18:21,282 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 641 flow [2023-08-30 23:18:21,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-30 23:18:21,283 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2023-08-30 23:18:21,283 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 641 flow [2023-08-30 23:18:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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 23:18:21,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:21,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:21,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:18:21,284 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:21,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1863612142, now seen corresponding path program 2 times [2023-08-30 23:18:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625026527] [2023-08-30 23:18:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:18:21,568 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 23:18:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:18:21,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625026527] [2023-08-30 23:18:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625026527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:18:21,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:18:21,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:18:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831434651] [2023-08-30 23:18:21,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:18:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:18:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:18:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:18:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:18:21,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 217 [2023-08-30 23:18:21,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 641 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 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 23:18:21,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:18:21,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 217 [2023-08-30 23:18:21,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:18:21,855 INFO L130 PetriNetUnfolder]: 403/823 cut-off events. [2023-08-30 23:18:21,856 INFO L131 PetriNetUnfolder]: For 4427/4524 co-relation queries the response was YES. [2023-08-30 23:18:21,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 823 events. 403/823 cut-off events. For 4427/4524 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4965 event pairs, 21 based on Foata normal form. 113/929 useless extension candidates. Maximal degree in co-relation 4031. Up to 244 conditions per place. [2023-08-30 23:18:21,861 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 53 selfloop transitions, 15 changer transitions 62/138 dead transitions. [2023-08-30 23:18:21,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1624 flow [2023-08-30 23:18:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:18:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:18:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1035 transitions. [2023-08-30 23:18:21,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5299539170506913 [2023-08-30 23:18:21,865 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1035 transitions. [2023-08-30 23:18:21,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1035 transitions. [2023-08-30 23:18:21,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:18:21,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1035 transitions. [2023-08-30 23:18:21,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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 23:18:21,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 23:18:21,872 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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 23:18:21,872 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 641 flow. Second operand 9 states and 1035 transitions. [2023-08-30 23:18:21,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1624 flow [2023-08-30 23:18:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 138 transitions, 1481 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-30 23:18:21,883 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 403 flow [2023-08-30 23:18:21,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2023-08-30 23:18:21,883 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2023-08-30 23:18:21,883 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 403 flow [2023-08-30 23:18:21,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 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 23:18:21,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:18:21,884 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] [2023-08-30 23:18:21,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 23:18:21,885 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 23:18:21,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:18:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1505780361, now seen corresponding path program 1 times [2023-08-30 23:18:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:18:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573474336] [2023-08-30 23:18:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:18:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:18:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:18:21,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:18:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:18:22,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:18:22,056 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:18:22,057 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 23:18:22,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-30 23:18:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-30 23:18:22,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-30 23:18:22,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 23:18:22,061 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 23:18:22,065 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:18:22,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:18:22,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:18:22 BasicIcfg [2023-08-30 23:18:22,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:18:22,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:18:22,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:18:22,163 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:18:22,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:17:53" (3/4) ... [2023-08-30 23:18:22,165 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:18:22,263 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:18:22,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:18:22,264 INFO L158 Benchmark]: Toolchain (without parser) took 30897.42ms. Allocated memory was 73.4MB in the beginning and 627.0MB in the end (delta: 553.6MB). Free memory was 49.1MB in the beginning and 293.1MB in the end (delta: -244.0MB). Peak memory consumption was 311.6MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,264 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 54.5MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:18:22,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.15ms. Allocated memory is still 73.4MB. Free memory was 48.7MB in the beginning and 41.8MB in the end (delta: 6.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.97ms. Allocated memory is still 73.4MB. Free memory was 41.8MB in the beginning and 38.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:18:22,265 INFO L158 Benchmark]: Boogie Preprocessor took 67.29ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,265 INFO L158 Benchmark]: RCFGBuilder took 1050.22ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 57.0MB in the end (delta: -20.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,266 INFO L158 Benchmark]: TraceAbstraction took 29045.74ms. Allocated memory was 88.1MB in the beginning and 627.0MB in the end (delta: 539.0MB). Free memory was 56.3MB in the beginning and 308.8MB in the end (delta: -252.5MB). Peak memory consumption was 287.4MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,266 INFO L158 Benchmark]: Witness Printer took 100.18ms. Allocated memory is still 627.0MB. Free memory was 308.8MB in the beginning and 293.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:18:22,267 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.26ms. Allocated memory is still 54.5MB. Free memory is still 32.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.15ms. Allocated memory is still 73.4MB. Free memory was 48.7MB in the beginning and 41.8MB in the end (delta: 6.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.97ms. Allocated memory is still 73.4MB. Free memory was 41.8MB in the beginning and 38.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.29ms. Allocated memory is still 73.4MB. Free memory was 38.9MB in the beginning and 36.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1050.22ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 36.2MB in the beginning and 57.0MB in the end (delta: -20.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29045.74ms. Allocated memory was 88.1MB in the beginning and 627.0MB in the end (delta: 539.0MB). Free memory was 56.3MB in the beginning and 308.8MB in the end (delta: -252.5MB). Peak memory consumption was 287.4MB. Max. memory is 16.1GB. * Witness Printer took 100.18ms. Allocated memory is still 627.0MB. Free memory was 308.8MB in the beginning and 293.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 119 PlacesBefore, 31 PlacesAfterwards, 110 TransitionsBefore, 22 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1355, independent: 1157, independent conditional: 0, independent unconditional: 1157, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 612, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1355, independent: 576, independent conditional: 0, independent unconditional: 576, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 612, unknown conditional: 0, unknown unconditional: 612] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1837, ((void *)0), P0, ((void *)0))=1, t1837={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L854] 0 pthread_t t1838; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1838, ((void *)0), P1, ((void *)0))=2, t1837={7:0}, t1838={5:0}, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L856] 0 pthread_t t1839; [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 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) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=3, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, 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={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !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) [L815] EXPR 3 \read(y) [L815] EXPR 3 !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) [L815] 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) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] EXPR 3 \read(y) [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 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) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 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) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 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 [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={7:0}, t1838={5:0}, t1839={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, 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={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !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) [L874] EXPR 0 \read(y) [L874] EXPR 0 !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) [L874] 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) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, 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={3:0}] - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 150 locations, 4 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: 28.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1293 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 996 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 973 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2939 IncrementalHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 23 mSDtfsCounter, 2939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=672occurred in iteration=14, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 3308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 23:18:22,300 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