./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --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:06:12,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:06:12,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:06:12,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:06:12,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:06:12,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:06:12,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:06:12,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:06:12,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:06:12,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:06:12,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:06:12,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:06:12,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:06:12,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:06:12,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:06:12,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:06:12,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:06:12,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:06:12,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:06:12,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:06:12,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:06:12,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:06:12,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:06:12,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:06:12,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:06:12,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:06:12,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:06:12,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:06:12,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:06:12,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:06:12,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:06:12,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:06:12,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:06:12,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:06:12,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:06:12,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:06:12,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:06:12,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:06:12,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:06:12,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:06:12,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:06:12,140 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:06:12,171 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:06:12,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:06:12,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:06:12,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:06:12,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:06:12,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:06:12,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:06:12,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:06:12,174 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:06:12,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:06:12,175 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:06:12,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:06:12,176 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:06:12,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:06:12,177 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:06:12,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:06:12,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:06:12,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:06:12,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:06:12,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:06:12,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:06:12,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:06:12,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:06:12,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:06:12,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:06:12,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:06:12,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:06:12,179 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:06:12,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:06:12,180 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:06:12,180 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 -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a 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:06:12,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:06:12,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:06:12,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:06:12,463 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:06:12,463 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:06:12,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-30 23:06:13,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:06:13,745 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:06:13,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-30 23:06:13,759 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/371c83569/6c59fc65a6c147e4896b98de17de7085/FLAG781ed597a [2023-08-30 23:06:13,772 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/371c83569/6c59fc65a6c147e4896b98de17de7085 [2023-08-30 23:06:13,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:06:13,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:06:13,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:06:13,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:06:13,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:06:13,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:06:13" (1/1) ... [2023-08-30 23:06:13,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8a08b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:13, skipping insertion in model container [2023-08-30 23:06:13,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:06:13" (1/1) ... [2023-08-30 23:06:13,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:06:13,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:06:13,986 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-30 23:06:14,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:06:14,194 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:06:14,204 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-30 23:06:14,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:06:14,310 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:06:14,311 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:06:14,316 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:06:14,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14 WrapperNode [2023-08-30 23:06:14,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:06:14,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:06:14,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:06:14,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:06:14,322 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:06:14" (1/1) ... [2023-08-30 23:06:14,337 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:06:14" (1/1) ... [2023-08-30 23:06:14,360 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-30 23:06:14,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:06:14,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:06:14,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:06:14,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:06:14,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:06:14,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:06:14,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:06:14,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:06:14,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (1/1) ... [2023-08-30 23:06:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:06:14,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:06:14,416 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:06:14,440 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:06:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:06:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:06:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:06:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:06:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:06:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:06:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:06:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:06:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:06:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:06:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:06:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:06:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:06:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:06:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:06:14,465 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:06:14,633 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:06:14,636 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:06:14,988 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:06:15,120 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:06:15,121 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:06:15,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:06:15 BoogieIcfgContainer [2023-08-30 23:06:15,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:06:15,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:06:15,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:06:15,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:06:15,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:06:13" (1/3) ... [2023-08-30 23:06:15,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224f5b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:06:15, skipping insertion in model container [2023-08-30 23:06:15,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:06:14" (2/3) ... [2023-08-30 23:06:15,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224f5b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:06:15, skipping insertion in model container [2023-08-30 23:06:15,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:06:15" (3/3) ... [2023-08-30 23:06:15,131 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-30 23:06:15,150 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:06:15,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:06:15,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:06:15,159 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:06:15,210 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:06:15,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2023-08-30 23:06:15,299 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-08-30 23:06:15,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:06:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:06:15,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2023-08-30 23:06:15,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2023-08-30 23:06:15,313 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:06:15,324 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2023-08-30 23:06:15,327 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2023-08-30 23:06:15,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2023-08-30 23:06:15,356 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2023-08-30 23:06:15,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:06:15,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:06:15,359 INFO L119 LiptonReduction]: Number of co-enabled transitions 1860 [2023-08-30 23:06:18,552 INFO L134 LiptonReduction]: Checked pairs total: 4636 [2023-08-30 23:06:18,553 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-30 23:06:18,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:06:18,568 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;@8a0d845, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:06:18,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:06:18,572 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-08-30 23:06:18,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:06:18,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:18,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:18,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:18,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 599611159, now seen corresponding path program 1 times [2023-08-30 23:06:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081670615] [2023-08-30 23:06:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:19,057 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:06:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081670615] [2023-08-30 23:06:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081670615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:19,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:06:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653014012] [2023-08-30 23:06:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:19,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:06:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:06:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:06:19,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 204 [2023-08-30 23:06:19,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:06:19,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:19,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 204 [2023-08-30 23:06:19,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:19,411 INFO L130 PetriNetUnfolder]: 910/1453 cut-off events. [2023-08-30 23:06:19,412 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-30 23:06:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 1453 events. 910/1453 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7427 event pairs, 146 based on Foata normal form. 60/1389 useless extension candidates. Maximal degree in co-relation 2840. Up to 1101 conditions per place. [2023-08-30 23:06:19,421 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 26 selfloop transitions, 2 changer transitions 4/35 dead transitions. [2023-08-30 23:06:19,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 143 flow [2023-08-30 23:06:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:06:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:06:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-30 23:06:19,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375816993464052 [2023-08-30 23:06:19,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-30 23:06:19,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-30 23:06:19,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:19,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-30 23:06:19,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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:06:19,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:06:19,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:06:19,446 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 329 transitions. [2023-08-30 23:06:19,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 143 flow [2023-08-30 23:06:19,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:06:19,449 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-30 23:06:19,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-30 23:06:19,453 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-30 23:06:19,454 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-30 23:06:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:06:19,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:19,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:19,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:06:19,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:19,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 249004041, now seen corresponding path program 1 times [2023-08-30 23:06:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813712397] [2023-08-30 23:06:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:19,716 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:06:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813712397] [2023-08-30 23:06:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813712397] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:06:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761915131] [2023-08-30 23:06:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:06:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:06:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:06:19,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-08-30 23:06:19,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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:06:19,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:19,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-08-30 23:06:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:20,048 INFO L130 PetriNetUnfolder]: 1505/2258 cut-off events. [2023-08-30 23:06:20,049 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2023-08-30 23:06:20,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 2258 events. 1505/2258 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9794 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4672. Up to 1889 conditions per place. [2023-08-30 23:06:20,058 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-08-30 23:06:20,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 232 flow [2023-08-30 23:06:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2023-08-30 23:06:20,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2023-08-30 23:06:20,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 490 transitions. [2023-08-30 23:06:20,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 490 transitions. [2023-08-30 23:06:20,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:20,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 490 transitions. [2023-08-30 23:06:20,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 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:06:20,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:20,067 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:20,067 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 490 transitions. [2023-08-30 23:06:20,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 232 flow [2023-08-30 23:06:20,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:20,070 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 86 flow [2023-08-30 23:06:20,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-30 23:06:20,071 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-30 23:06:20,071 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 86 flow [2023-08-30 23:06:20,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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:06:20,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:20,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:20,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:06:20,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:20,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1991600891, now seen corresponding path program 1 times [2023-08-30 23:06:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197537113] [2023-08-30 23:06:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:20,255 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:06:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197537113] [2023-08-30 23:06:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197537113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277725576] [2023-08-30 23:06:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:20,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:20,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-08-30 23:06:20,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:20,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:20,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-08-30 23:06:20,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:20,570 INFO L130 PetriNetUnfolder]: 1301/1954 cut-off events. [2023-08-30 23:06:20,571 INFO L131 PetriNetUnfolder]: For 1001/1001 co-relation queries the response was YES. [2023-08-30 23:06:20,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4925 conditions, 1954 events. 1301/1954 cut-off events. For 1001/1001 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8253 event pairs, 447 based on Foata normal form. 100/2054 useless extension candidates. Maximal degree in co-relation 4912. Up to 1237 conditions per place. [2023-08-30 23:06:20,580 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 34 selfloop transitions, 3 changer transitions 21/58 dead transitions. [2023-08-30 23:06:20,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 300 flow [2023-08-30 23:06:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-30 23:06:20,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2023-08-30 23:06:20,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-30 23:06:20,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-30 23:06:20,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:20,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-30 23:06:20,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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:06:20,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:20,587 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:20,587 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 86 flow. Second operand 5 states and 492 transitions. [2023-08-30 23:06:20,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 300 flow [2023-08-30 23:06:20,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 58 transitions, 294 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:06:20,593 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 95 flow [2023-08-30 23:06:20,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-30 23:06:20,594 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-30 23:06:20,594 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 95 flow [2023-08-30 23:06:20,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:20,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:20,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:20,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:06:20,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:20,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 80937774, now seen corresponding path program 1 times [2023-08-30 23:06:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485090001] [2023-08-30 23:06:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:20,758 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:06:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:20,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485090001] [2023-08-30 23:06:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485090001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578389264] [2023-08-30 23:06:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:20,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:20,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2023-08-30 23:06:20,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:20,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:20,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2023-08-30 23:06:20,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:21,076 INFO L130 PetriNetUnfolder]: 1129/1706 cut-off events. [2023-08-30 23:06:21,078 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2023-08-30 23:06:21,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 1706 events. 1129/1706 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6797 event pairs, 323 based on Foata normal form. 72/1778 useless extension candidates. Maximal degree in co-relation 4450. Up to 1077 conditions per place. [2023-08-30 23:06:21,089 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 31 selfloop transitions, 3 changer transitions 16/50 dead transitions. [2023-08-30 23:06:21,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 272 flow [2023-08-30 23:06:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2023-08-30 23:06:21,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745098039215686 [2023-08-30 23:06:21,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 484 transitions. [2023-08-30 23:06:21,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 484 transitions. [2023-08-30 23:06:21,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:21,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 484 transitions. [2023-08-30 23:06:21,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 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:06:21,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:21,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:21,099 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 95 flow. Second operand 5 states and 484 transitions. [2023-08-30 23:06:21,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 272 flow [2023-08-30 23:06:21,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:21,106 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 100 flow [2023-08-30 23:06:21,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2023-08-30 23:06:21,107 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-08-30 23:06:21,108 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 100 flow [2023-08-30 23:06:21,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:21,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:21,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:21,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:06:21,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:21,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1263645636, now seen corresponding path program 1 times [2023-08-30 23:06:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447410636] [2023-08-30 23:06:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:21,330 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:06:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447410636] [2023-08-30 23:06:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447410636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:06:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833224788] [2023-08-30 23:06:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:21,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:06:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:06:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:06:21,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-08-30 23:06:21,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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:06:21,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:21,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-08-30 23:06:21,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:21,449 INFO L130 PetriNetUnfolder]: 373/660 cut-off events. [2023-08-30 23:06:21,449 INFO L131 PetriNetUnfolder]: For 391/404 co-relation queries the response was YES. [2023-08-30 23:06:21,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 660 events. 373/660 cut-off events. For 391/404 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2824 event pairs, 98 based on Foata normal form. 36/686 useless extension candidates. Maximal degree in co-relation 1661. Up to 518 conditions per place. [2023-08-30 23:06:21,453 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-30 23:06:21,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 203 flow [2023-08-30 23:06:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:06:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:06:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-30 23:06:21,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2023-08-30 23:06:21,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-30 23:06:21,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-30 23:06:21,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:21,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-30 23:06:21,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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:06:21,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:06:21,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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:06:21,458 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 100 flow. Second operand 3 states and 318 transitions. [2023-08-30 23:06:21,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 203 flow [2023-08-30 23:06:21,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:21,461 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 116 flow [2023-08-30 23:06:21,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-30 23:06:21,462 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-30 23:06:21,462 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 116 flow [2023-08-30 23:06:21,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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:06:21,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:21,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:21,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:06:21,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:21,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash -271009099, now seen corresponding path program 1 times [2023-08-30 23:06:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:21,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484744928] [2023-08-30 23:06:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:21,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:21,810 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:06:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484744928] [2023-08-30 23:06:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484744928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:21,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:06:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375862906] [2023-08-30 23:06:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:06:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:06:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:06:21,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-08-30 23:06:21,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 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:06:21,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:21,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-08-30 23:06:21,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:21,923 INFO L130 PetriNetUnfolder]: 177/357 cut-off events. [2023-08-30 23:06:21,923 INFO L131 PetriNetUnfolder]: For 124/130 co-relation queries the response was YES. [2023-08-30 23:06:21,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 357 events. 177/357 cut-off events. For 124/130 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1422 event pairs, 53 based on Foata normal form. 37/386 useless extension candidates. Maximal degree in co-relation 1002. Up to 113 conditions per place. [2023-08-30 23:06:21,926 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 37 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-30 23:06:21,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 268 flow [2023-08-30 23:06:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:06:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:06:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-30 23:06:21,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2023-08-30 23:06:21,928 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-30 23:06:21,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-30 23:06:21,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:21,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-30 23:06:21,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:06:21,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 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:06:21,932 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 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:06:21,932 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 116 flow. Second operand 4 states and 424 transitions. [2023-08-30 23:06:21,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 268 flow [2023-08-30 23:06:21,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:06:21,935 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 152 flow [2023-08-30 23:06:21,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-30 23:06:21,937 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-08-30 23:06:21,938 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 152 flow [2023-08-30 23:06:21,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 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:06:21,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:21,939 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:06:21,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:06:21,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:21,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2019487718, now seen corresponding path program 1 times [2023-08-30 23:06:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:21,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212616431] [2023-08-30 23:06:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:22,192 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:06:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212616431] [2023-08-30 23:06:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212616431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481021479] [2023-08-30 23:06:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:22,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-08-30 23:06:22,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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:06:22,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:22,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-08-30 23:06:22,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:22,298 INFO L130 PetriNetUnfolder]: 142/286 cut-off events. [2023-08-30 23:06:22,298 INFO L131 PetriNetUnfolder]: For 286/291 co-relation queries the response was YES. [2023-08-30 23:06:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 286 events. 142/286 cut-off events. For 286/291 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1126 event pairs, 49 based on Foata normal form. 11/289 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2023-08-30 23:06:22,300 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 34 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2023-08-30 23:06:22,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 292 flow [2023-08-30 23:06:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-30 23:06:22,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088235294117647 [2023-08-30 23:06:22,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-30 23:06:22,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-30 23:06:22,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:22,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-30 23:06:22,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 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:06:22,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:22,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:22,306 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 152 flow. Second operand 5 states and 519 transitions. [2023-08-30 23:06:22,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 292 flow [2023-08-30 23:06:22,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 262 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:22,308 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 152 flow [2023-08-30 23:06:22,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 23:06:22,309 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-08-30 23:06:22,309 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 152 flow [2023-08-30 23:06:22,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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:06:22,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:22,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:06:22,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:22,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash -863614358, now seen corresponding path program 1 times [2023-08-30 23:06:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396891860] [2023-08-30 23:06:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:22,896 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:06:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396891860] [2023-08-30 23:06:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396891860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:22,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:06:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718853257] [2023-08-30 23:06:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:22,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:06:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:06:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:06:22,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 204 [2023-08-30 23:06:22,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 152 flow. Second operand has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 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:06:22,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:22,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 204 [2023-08-30 23:06:22,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:23,283 INFO L130 PetriNetUnfolder]: 345/613 cut-off events. [2023-08-30 23:06:23,283 INFO L131 PetriNetUnfolder]: For 957/957 co-relation queries the response was YES. [2023-08-30 23:06:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 613 events. 345/613 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2451 event pairs, 4 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 2031. Up to 258 conditions per place. [2023-08-30 23:06:23,287 INFO L137 encePairwiseOnDemand]: 195/204 looper letters, 53 selfloop transitions, 16 changer transitions 44/113 dead transitions. [2023-08-30 23:06:23,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 113 transitions, 788 flow [2023-08-30 23:06:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 23:06:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 23:06:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1240 transitions. [2023-08-30 23:06:23,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4341736694677871 [2023-08-30 23:06:23,291 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1240 transitions. [2023-08-30 23:06:23,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1240 transitions. [2023-08-30 23:06:23,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:23,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1240 transitions. [2023-08-30 23:06:23,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.57142857142857) internal successors, (1240), 14 states have internal predecessors, (1240), 0 states have call successors, (0), 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:06:23,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 204.0) internal successors, (3060), 15 states have internal predecessors, (3060), 0 states have call successors, (0), 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:06:23,299 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 204.0) internal successors, (3060), 15 states have internal predecessors, (3060), 0 states have call successors, (0), 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:06:23,299 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 152 flow. Second operand 14 states and 1240 transitions. [2023-08-30 23:06:23,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 113 transitions, 788 flow [2023-08-30 23:06:23,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 113 transitions, 676 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-08-30 23:06:23,305 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 222 flow [2023-08-30 23:06:23,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=222, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-30 23:06:23,308 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2023-08-30 23:06:23,308 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 222 flow [2023-08-30 23:06:23,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 states have internal predecessors, (760), 0 states have call successors, (0), 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:06:23,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:23,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:23,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:06:23,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:23,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 611481242, now seen corresponding path program 2 times [2023-08-30 23:06:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543956303] [2023-08-30 23:06:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:23,587 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:06:23,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:23,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543956303] [2023-08-30 23:06:23,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543956303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:23,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:23,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:23,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209157346] [2023-08-30 23:06:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:23,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:23,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 204 [2023-08-30 23:06:23,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:23,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:23,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 204 [2023-08-30 23:06:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:23,760 INFO L130 PetriNetUnfolder]: 294/531 cut-off events. [2023-08-30 23:06:23,760 INFO L131 PetriNetUnfolder]: For 931/931 co-relation queries the response was YES. [2023-08-30 23:06:23,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 531 events. 294/531 cut-off events. For 931/931 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2106 event pairs, 47 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 1954. Up to 349 conditions per place. [2023-08-30 23:06:23,764 INFO L137 encePairwiseOnDemand]: 195/204 looper letters, 67 selfloop transitions, 19 changer transitions 6/92 dead transitions. [2023-08-30 23:06:23,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 654 flow [2023-08-30 23:06:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:06:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:06:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2023-08-30 23:06:23,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-30 23:06:23,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2023-08-30 23:06:23,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2023-08-30 23:06:23,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:23,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2023-08-30 23:06:23,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 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:06:23,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:06:23,770 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 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:06:23,771 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 222 flow. Second operand 6 states and 570 transitions. [2023-08-30 23:06:23,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 654 flow [2023-08-30 23:06:23,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 602 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-30 23:06:23,775 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 312 flow [2023-08-30 23:06:23,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-30 23:06:23,776 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-08-30 23:06:23,777 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 312 flow [2023-08-30 23:06:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 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:06:23,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:23,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:06:23,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:23,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 709461144, now seen corresponding path program 3 times [2023-08-30 23:06:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070987165] [2023-08-30 23:06:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:24,012 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:06:24,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:24,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070987165] [2023-08-30 23:06:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070987165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:24,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:24,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:24,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258615985] [2023-08-30 23:06:24,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:24,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:24,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:24,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:24,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-08-30 23:06:24,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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:06:24,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:24,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-08-30 23:06:24,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:24,171 INFO L130 PetriNetUnfolder]: 257/521 cut-off events. [2023-08-30 23:06:24,171 INFO L131 PetriNetUnfolder]: For 972/980 co-relation queries the response was YES. [2023-08-30 23:06:24,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 521 events. 257/521 cut-off events. For 972/980 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2377 event pairs, 50 based on Foata normal form. 4/518 useless extension candidates. Maximal degree in co-relation 1940. Up to 248 conditions per place. [2023-08-30 23:06:24,174 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 39 selfloop transitions, 1 changer transitions 40/85 dead transitions. [2023-08-30 23:06:24,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 620 flow [2023-08-30 23:06:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-08-30 23:06:24,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872549019607843 [2023-08-30 23:06:24,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-08-30 23:06:24,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-08-30 23:06:24,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:24,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-08-30 23:06:24,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 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:06:24,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:24,180 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:24,180 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 312 flow. Second operand 5 states and 497 transitions. [2023-08-30 23:06:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 620 flow [2023-08-30 23:06:24,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 612 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 23:06:24,185 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 204 flow [2023-08-30 23:06:24,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-08-30 23:06:24,185 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-08-30 23:06:24,186 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 204 flow [2023-08-30 23:06:24,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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:06:24,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:24,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:24,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:06:24,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:24,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -362139612, now seen corresponding path program 4 times [2023-08-30 23:06:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030438176] [2023-08-30 23:06:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:24,404 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:06:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030438176] [2023-08-30 23:06:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030438176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:06:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594013917] [2023-08-30 23:06:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:24,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:06:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:06:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:06:24,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 204 [2023-08-30 23:06:24,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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:06:24,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:24,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 204 [2023-08-30 23:06:24,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:24,541 INFO L130 PetriNetUnfolder]: 144/311 cut-off events. [2023-08-30 23:06:24,542 INFO L131 PetriNetUnfolder]: For 709/709 co-relation queries the response was YES. [2023-08-30 23:06:24,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 311 events. 144/311 cut-off events. For 709/709 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1245 event pairs, 41 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1184. Up to 177 conditions per place. [2023-08-30 23:06:24,544 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 30 selfloop transitions, 1 changer transitions 30/63 dead transitions. [2023-08-30 23:06:24,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 453 flow [2023-08-30 23:06:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:06:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:06:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2023-08-30 23:06:24,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4843137254901961 [2023-08-30 23:06:24,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2023-08-30 23:06:24,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2023-08-30 23:06:24,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:24,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2023-08-30 23:06:24,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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:06:24,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:24,549 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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:06:24,549 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 204 flow. Second operand 5 states and 494 transitions. [2023-08-30 23:06:24,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 453 flow [2023-08-30 23:06:24,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 430 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-30 23:06:24,553 INFO L231 Difference]: Finished difference. Result has 57 places, 28 transitions, 143 flow [2023-08-30 23:06:24,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=57, PETRI_TRANSITIONS=28} [2023-08-30 23:06:24,553 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-08-30 23:06:24,553 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 28 transitions, 143 flow [2023-08-30 23:06:24,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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:06:24,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:24,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:24,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:06:24,554 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:24,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash 662735866, now seen corresponding path program 5 times [2023-08-30 23:06:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523498450] [2023-08-30 23:06:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:06:25,905 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:06:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:06:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523498450] [2023-08-30 23:06:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523498450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:06:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:06:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:06:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281615384] [2023-08-30 23:06:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:06:25,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:06:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:06:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:06:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:06:26,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-08-30 23:06:26,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 28 transitions, 143 flow. Second operand has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 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:06:26,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:06:26,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-08-30 23:06:26,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:06:26,304 INFO L130 PetriNetUnfolder]: 61/155 cut-off events. [2023-08-30 23:06:26,305 INFO L131 PetriNetUnfolder]: For 323/334 co-relation queries the response was YES. [2023-08-30 23:06:26,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 155 events. 61/155 cut-off events. For 323/334 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 551 event pairs, 8 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 569. Up to 63 conditions per place. [2023-08-30 23:06:26,306 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 24 selfloop transitions, 5 changer transitions 17/49 dead transitions. [2023-08-30 23:06:26,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 353 flow [2023-08-30 23:06:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:06:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:06:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2023-08-30 23:06:26,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542483660130719 [2023-08-30 23:06:26,308 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 834 transitions. [2023-08-30 23:06:26,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 834 transitions. [2023-08-30 23:06:26,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:06:26,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 834 transitions. [2023-08-30 23:06:26,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 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:06:26,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 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:06:26,313 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 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:06:26,313 INFO L175 Difference]: Start difference. First operand has 57 places, 28 transitions, 143 flow. Second operand 9 states and 834 transitions. [2023-08-30 23:06:26,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 353 flow [2023-08-30 23:06:26,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 324 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-30 23:06:26,315 INFO L231 Difference]: Finished difference. Result has 54 places, 28 transitions, 140 flow [2023-08-30 23:06:26,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2023-08-30 23:06:26,316 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-08-30 23:06:26,316 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 140 flow [2023-08-30 23:06:26,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 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:06:26,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:06:26,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:26,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:06:26,317 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:06:26,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:06:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1796414744, now seen corresponding path program 6 times [2023-08-30 23:06:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:06:26,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647155083] [2023-08-30 23:06:26,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:06:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:06:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:06:26,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:06:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:06:26,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:06:26,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:06:26,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:06:26,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:06:26,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:06:26,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:06:26,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:06:26,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:06:26,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:06:26,423 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:06:26,428 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:06:26,428 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:06:26,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:06:26 BasicIcfg [2023-08-30 23:06:26,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:06:26,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:06:26,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:06:26,509 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:06:26,509 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:06:15" (3/4) ... [2023-08-30 23:06:26,511 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:06:26,592 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:06:26,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:06:26,593 INFO L158 Benchmark]: Toolchain (without parser) took 12816.73ms. Allocated memory was 75.5MB in the beginning and 295.7MB in the end (delta: 220.2MB). Free memory was 50.9MB in the beginning and 175.3MB in the end (delta: -124.4MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,593 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:06:26,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.67ms. Allocated memory is still 75.5MB. Free memory was 50.7MB in the beginning and 43.9MB in the end (delta: 6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.46ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,594 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 75.5MB. Free memory was 40.9MB in the beginning and 38.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,594 INFO L158 Benchmark]: RCFGBuilder took 732.87ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 27.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,594 INFO L158 Benchmark]: TraceAbstraction took 11383.70ms. Allocated memory was 75.5MB in the beginning and 295.7MB in the end (delta: 220.2MB). Free memory was 26.2MB in the beginning and 185.8MB in the end (delta: -159.6MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,595 INFO L158 Benchmark]: Witness Printer took 83.67ms. Allocated memory is still 295.7MB. Free memory was 185.8MB in the beginning and 175.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:06:26,596 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.16ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.67ms. Allocated memory is still 75.5MB. Free memory was 50.7MB in the beginning and 43.9MB in the end (delta: 6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.46ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 40.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 75.5MB. Free memory was 40.9MB in the beginning and 38.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 732.87ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 27.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11383.70ms. Allocated memory was 75.5MB in the beginning and 295.7MB in the end (delta: 220.2MB). Free memory was 26.2MB in the beginning and 185.8MB in the end (delta: -159.6MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 83.67ms. Allocated memory is still 295.7MB. Free memory was 185.8MB in the beginning and 175.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 116 PlacesBefore, 35 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4636 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2483, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1023, independent: 989, independent conditional: 0, independent unconditional: 989, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2483, independent: 1335, independent conditional: 0, independent unconditional: 1335, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1023, unknown conditional: 0, unknown unconditional: 1023] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=-2, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=-1, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 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) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L826] 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) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3: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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 509 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 91 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=9, InterpolantAutomatonStates: 69, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:06:26,628 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