./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix055.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 a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:52:28,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:52:28,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:52:28,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:52:28,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:52:28,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:52:28,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:52:28,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:52:28,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:52:28,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:52:28,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:52:28,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:52:28,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:52:28,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:52:28,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:52:28,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:52:28,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:52:28,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:52:28,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:52:28,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:52:28,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:52:28,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:52:28,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:52:28,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:52:28,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:52:28,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:52:28,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:52:28,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:52:28,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:52:28,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:52:28,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:52:28,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:52:28,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:52:28,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:52:28,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:52:28,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:52:28,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:52:28,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:52:28,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:52:28,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:52:28,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:52:28,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:52:28,334 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:52:28,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:52:28,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:52:28,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:52:28,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:52:28,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:52:28,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:52:28,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:52:28,338 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:52:28,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:52:28,339 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:52:28,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:52:28,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:52:28,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:52:28,340 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:52:28,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:52:28,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:52:28,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:52:28,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:52:28,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:28,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:52:28,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:52:28,343 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:52:28,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:52:28,343 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:52:28,343 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 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 -> BEFORE [2023-09-01 09:52:28,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:52:28,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:52:28,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:52:28,595 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:52:28,595 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:52:28,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-09-01 09:52:29,562 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:52:29,771 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:52:29,772 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-09-01 09:52:29,782 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f08f2cf/9144f09e6df0449f89c12486c861a4ca/FLAG10329e02d [2023-09-01 09:52:29,792 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f08f2cf/9144f09e6df0449f89c12486c861a4ca [2023-09-01 09:52:29,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:52:29,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:52:29,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:29,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:52:29,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:52:29,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:29" (1/1) ... [2023-09-01 09:52:29,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be3711e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:29, skipping insertion in model container [2023-09-01 09:52:29,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:29" (1/1) ... [2023-09-01 09:52:29,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:52:29,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:52:29,943 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/mix055.opt.i[944,957] [2023-09-01 09:52:30,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:30,129 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:52:30,137 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/mix055.opt.i[944,957] [2023-09-01 09:52:30,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:30,224 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:30,224 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:30,229 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:52:30,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30 WrapperNode [2023-09-01 09:52:30,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:30,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:30,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:52:30,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:52:30,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,287 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-09-01 09:52:30,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:30,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:52:30,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:52:30,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:52:30,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,327 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:52:30,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:52:30,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:52:30,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:52:30,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:52:30,357 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-09-01 09:52:30,375 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-09-01 09:52:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:52:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:52:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:52:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:52:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:52:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:52:30,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:52:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:52:30,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:52:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:52:30,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:52:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:52:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:52:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:52:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:52:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:52:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:52:30,389 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:52:30,516 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:52:30,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:52:30,716 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:52:30,817 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:52:30,819 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:52:30,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30 BoogieIcfgContainer [2023-09-01 09:52:30,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:52:30,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:52:30,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:52:30,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:52:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:52:29" (1/3) ... [2023-09-01 09:52:30,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714d3ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:30, skipping insertion in model container [2023-09-01 09:52:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (2/3) ... [2023-09-01 09:52:30,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714d3ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:30, skipping insertion in model container [2023-09-01 09:52:30,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30" (3/3) ... [2023-09-01 09:52:30,825 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-09-01 09:52:30,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:52:30,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:52:30,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:52:30,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:52:30,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:52:30,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2023-09-01 09:52:30,962 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-09-01 09:52:30,973 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:30,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-09-01 09:52:30,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2023-09-01 09:52:30,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2023-09-01 09:52:30,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:52:30,989 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2023-09-01 09:52:30,991 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2023-09-01 09:52:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2023-09-01 09:52:31,011 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-09-01 09:52:31,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-09-01 09:52:31,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 2736 [2023-09-01 09:52:34,982 INFO L134 LiptonReduction]: Checked pairs total: 6937 [2023-09-01 09:52:34,982 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-09-01 09:52:34,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:52:34,995 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;@17d4cca6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:52:34,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:52:34,999 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-09-01 09:52:34,999 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:34,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:34,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:35,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:35,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1113147127, now seen corresponding path program 1 times [2023-09-01 09:52:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498153805] [2023-09-01 09:52:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498153805] [2023-09-01 09:52:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498153805] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:35,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329289087] [2023-09-01 09:52:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:35,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:35,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:35,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-09-01 09:52:35,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-09-01 09:52:35,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:35,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-09-01 09:52:35,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:35,713 INFO L130 PetriNetUnfolder]: 2075/3094 cut-off events. [2023-09-01 09:52:35,714 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-09-01 09:52:35,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 3094 events. 2075/3094 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16319 event pairs, 518 based on Foata normal form. 0/2937 useless extension candidates. Maximal degree in co-relation 6078. Up to 2098 conditions per place. [2023-09-01 09:52:35,730 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-09-01 09:52:35,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 152 flow [2023-09-01 09:52:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:52:35,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-09-01 09:52:35,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:52:35,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:52:35,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:35,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:52:35,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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-09-01 09:52:35,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:52:35,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:52:35,759 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:52:35,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 152 flow [2023-09-01 09:52:35,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:35,764 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-09-01 09:52:35,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-09-01 09:52:35,769 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-09-01 09:52:35,769 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-09-01 09:52:35,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-09-01 09:52:35,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:35,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:35,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:52:35,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:35,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -287467971, now seen corresponding path program 1 times [2023-09-01 09:52:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466024199] [2023-09-01 09:52:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:35,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466024199] [2023-09-01 09:52:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466024199] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:36,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:52:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497637404] [2023-09-01 09:52:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:36,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:36,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:36,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:36,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-09-01 09:52:36,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 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-09-01 09:52:36,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:36,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-09-01 09:52:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:37,284 INFO L130 PetriNetUnfolder]: 5269/7342 cut-off events. [2023-09-01 09:52:37,284 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2023-09-01 09:52:37,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15282 conditions, 7342 events. 5269/7342 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 38098 event pairs, 399 based on Foata normal form. 200/7540 useless extension candidates. Maximal degree in co-relation 15272. Up to 5403 conditions per place. [2023-09-01 09:52:37,319 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 48 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2023-09-01 09:52:37,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 264 flow [2023-09-01 09:52:37,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-09-01 09:52:37,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498936170212766 [2023-09-01 09:52:37,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-09-01 09:52:37,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-09-01 09:52:37,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:37,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-09-01 09:52:37,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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-09-01 09:52:37,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:37,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:37,327 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 4 states and 469 transitions. [2023-09-01 09:52:37,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 264 flow [2023-09-01 09:52:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:37,329 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 128 flow [2023-09-01 09:52:37,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-09-01 09:52:37,330 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-09-01 09:52:37,330 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 128 flow [2023-09-01 09:52:37,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 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-09-01 09:52:37,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:37,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:37,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:52:37,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:37,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -321574632, now seen corresponding path program 1 times [2023-09-01 09:52:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:37,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950071366] [2023-09-01 09:52:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:37,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:37,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950071366] [2023-09-01 09:52:37,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950071366] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:37,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:37,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:52:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458566503] [2023-09-01 09:52:37,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:37,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:37,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:37,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:37,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-09-01 09:52:37,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:37,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:37,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-09-01 09:52:37,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:38,286 INFO L130 PetriNetUnfolder]: 5106/7424 cut-off events. [2023-09-01 09:52:38,287 INFO L131 PetriNetUnfolder]: For 2630/2659 co-relation queries the response was YES. [2023-09-01 09:52:38,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19410 conditions, 7424 events. 5106/7424 cut-off events. For 2630/2659 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39904 event pairs, 1437 based on Foata normal form. 39/7296 useless extension candidates. Maximal degree in co-relation 19398. Up to 5940 conditions per place. [2023-09-01 09:52:38,328 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-09-01 09:52:38,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 264 flow [2023-09-01 09:52:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-09-01 09:52:38,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205673758865248 [2023-09-01 09:52:38,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-09-01 09:52:38,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-09-01 09:52:38,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:38,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-09-01 09:52:38,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:38,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:52:38,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 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-09-01 09:52:38,334 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 128 flow. Second operand 3 states and 367 transitions. [2023-09-01 09:52:38,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 264 flow [2023-09-01 09:52:38,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:52:38,336 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 159 flow [2023-09-01 09:52:38,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-09-01 09:52:38,337 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-09-01 09:52:38,340 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 159 flow [2023-09-01 09:52:38,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:38,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:38,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:52:38,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:38,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1406657115, now seen corresponding path program 1 times [2023-09-01 09:52:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440798716] [2023-09-01 09:52:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440798716] [2023-09-01 09:52:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440798716] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910358346] [2023-09-01 09:52:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:39,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:39,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-09-01 09:52:39,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 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-09-01 09:52:39,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:39,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-09-01 09:52:39,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:40,055 INFO L130 PetriNetUnfolder]: 7138/9859 cut-off events. [2023-09-01 09:52:40,056 INFO L131 PetriNetUnfolder]: For 4361/4361 co-relation queries the response was YES. [2023-09-01 09:52:40,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28195 conditions, 9859 events. 7138/9859 cut-off events. For 4361/4361 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 46782 event pairs, 889 based on Foata normal form. 56/9915 useless extension candidates. Maximal degree in co-relation 28180. Up to 6766 conditions per place. [2023-09-01 09:52:40,096 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 52 selfloop transitions, 20 changer transitions 0/72 dead transitions. [2023-09-01 09:52:40,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 428 flow [2023-09-01 09:52:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2023-09-01 09:52:40,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48617021276595745 [2023-09-01 09:52:40,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2023-09-01 09:52:40,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2023-09-01 09:52:40,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:40,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2023-09-01 09:52:40,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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-09-01 09:52:40,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:40,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:40,103 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 159 flow. Second operand 4 states and 457 transitions. [2023-09-01 09:52:40,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 428 flow [2023-09-01 09:52:40,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:40,109 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 314 flow [2023-09-01 09:52:40,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2023-09-01 09:52:40,110 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-09-01 09:52:40,110 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 314 flow [2023-09-01 09:52:40,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 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-09-01 09:52:40,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:40,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:40,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:52:40,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:40,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1406583645, now seen corresponding path program 2 times [2023-09-01 09:52:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823241771] [2023-09-01 09:52:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:40,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823241771] [2023-09-01 09:52:40,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823241771] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:40,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:40,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981032549] [2023-09-01 09:52:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:40,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:40,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:40,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:40,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:40,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-09-01 09:52:40,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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-09-01 09:52:40,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:40,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-09-01 09:52:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:41,170 INFO L130 PetriNetUnfolder]: 5691/8153 cut-off events. [2023-09-01 09:52:41,170 INFO L131 PetriNetUnfolder]: For 11486/12080 co-relation queries the response was YES. [2023-09-01 09:52:41,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28134 conditions, 8153 events. 5691/8153 cut-off events. For 11486/12080 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 43540 event pairs, 1087 based on Foata normal form. 200/8195 useless extension candidates. Maximal degree in co-relation 28116. Up to 5845 conditions per place. [2023-09-01 09:52:41,214 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 57 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-09-01 09:52:41,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 566 flow [2023-09-01 09:52:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-09-01 09:52:41,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095744680851064 [2023-09-01 09:52:41,217 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-09-01 09:52:41,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-09-01 09:52:41,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:41,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-09-01 09:52:41,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-09-01 09:52:41,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:41,220 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:41,220 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 314 flow. Second operand 4 states and 479 transitions. [2023-09-01 09:52:41,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 566 flow [2023-09-01 09:52:41,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:41,225 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 354 flow [2023-09-01 09:52:41,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2023-09-01 09:52:41,225 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-09-01 09:52:41,226 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 354 flow [2023-09-01 09:52:41,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 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-09-01 09:52:41,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:41,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:41,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:52:41,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:41,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1740939578, now seen corresponding path program 1 times [2023-09-01 09:52:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495581488] [2023-09-01 09:52:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495581488] [2023-09-01 09:52:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495581488] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:41,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040610623] [2023-09-01 09:52:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:41,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:41,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:52:41,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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-09-01 09:52:41,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:41,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:52:41,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:42,286 INFO L130 PetriNetUnfolder]: 5590/8028 cut-off events. [2023-09-01 09:52:42,287 INFO L131 PetriNetUnfolder]: For 13902/14605 co-relation queries the response was YES. [2023-09-01 09:52:42,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29198 conditions, 8028 events. 5590/8028 cut-off events. For 13902/14605 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 43297 event pairs, 1027 based on Foata normal form. 151/7996 useless extension candidates. Maximal degree in co-relation 29178. Up to 5331 conditions per place. [2023-09-01 09:52:42,320 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 60 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2023-09-01 09:52:42,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 677 flow [2023-09-01 09:52:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-09-01 09:52:42,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138297872340426 [2023-09-01 09:52:42,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-09-01 09:52:42,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-09-01 09:52:42,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:42,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-09-01 09:52:42,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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-09-01 09:52:42,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:42,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:42,325 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 354 flow. Second operand 4 states and 483 transitions. [2023-09-01 09:52:42,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 677 flow [2023-09-01 09:52:42,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 666 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:42,332 INFO L231 Difference]: Finished difference. Result has 51 places, 57 transitions, 424 flow [2023-09-01 09:52:42,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=51, PETRI_TRANSITIONS=57} [2023-09-01 09:52:42,332 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-09-01 09:52:42,332 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 57 transitions, 424 flow [2023-09-01 09:52:42,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 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-09-01 09:52:42,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:42,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:42,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:52:42,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:42,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1942097801, now seen corresponding path program 1 times [2023-09-01 09:52:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:42,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633708918] [2023-09-01 09:52:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633708918] [2023-09-01 09:52:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633708918] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:42,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:42,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418204772] [2023-09-01 09:52:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:42,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:42,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 235 [2023-09-01 09:52:42,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-09-01 09:52:42,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:42,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 235 [2023-09-01 09:52:42,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:43,427 INFO L130 PetriNetUnfolder]: 6349/9129 cut-off events. [2023-09-01 09:52:43,427 INFO L131 PetriNetUnfolder]: For 19700/20381 co-relation queries the response was YES. [2023-09-01 09:52:43,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34270 conditions, 9129 events. 6349/9129 cut-off events. For 19700/20381 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 49914 event pairs, 902 based on Foata normal form. 272/9227 useless extension candidates. Maximal degree in co-relation 34249. Up to 5519 conditions per place. [2023-09-01 09:52:43,470 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 70 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2023-09-01 09:52:43,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 780 flow [2023-09-01 09:52:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:43,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-09-01 09:52:43,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512340425531915 [2023-09-01 09:52:43,472 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-09-01 09:52:43,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-09-01 09:52:43,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:43,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-09-01 09:52:43,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 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-09-01 09:52:43,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:52:43,475 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:52:43,475 INFO L175 Difference]: Start difference. First operand has 51 places, 57 transitions, 424 flow. Second operand 5 states and 602 transitions. [2023-09-01 09:52:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 780 flow [2023-09-01 09:52:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 766 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:43,488 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 499 flow [2023-09-01 09:52:43,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2023-09-01 09:52:43,489 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-09-01 09:52:43,489 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 499 flow [2023-09-01 09:52:43,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-09-01 09:52:43,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:43,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:43,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:52:43,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:43,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1967026285, now seen corresponding path program 1 times [2023-09-01 09:52:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210108178] [2023-09-01 09:52:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210108178] [2023-09-01 09:52:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210108178] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:43,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:43,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708677360] [2023-09-01 09:52:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:43,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:43,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-09-01 09:52:43,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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-09-01 09:52:43,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:43,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-09-01 09:52:43,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:44,503 INFO L130 PetriNetUnfolder]: 6579/9467 cut-off events. [2023-09-01 09:52:44,504 INFO L131 PetriNetUnfolder]: For 30685/31486 co-relation queries the response was YES. [2023-09-01 09:52:44,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37572 conditions, 9467 events. 6579/9467 cut-off events. For 30685/31486 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 52555 event pairs, 1126 based on Foata normal form. 362/9680 useless extension candidates. Maximal degree in co-relation 37548. Up to 5556 conditions per place. [2023-09-01 09:52:44,544 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 71 selfloop transitions, 23 changer transitions 0/105 dead transitions. [2023-09-01 09:52:44,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 951 flow [2023-09-01 09:52:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-09-01 09:52:44,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 09:52:44,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-09-01 09:52:44,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-09-01 09:52:44,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:44,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-09-01 09:52:44,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 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-09-01 09:52:44,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:44,550 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:44,550 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 499 flow. Second operand 6 states and 705 transitions. [2023-09-01 09:52:44,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 951 flow [2023-09-01 09:52:44,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 922 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:44,591 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 611 flow [2023-09-01 09:52:44,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-09-01 09:52:44,592 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-09-01 09:52:44,592 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 611 flow [2023-09-01 09:52:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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-09-01 09:52:44,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:44,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:44,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:52:44,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:44,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1117299462, now seen corresponding path program 1 times [2023-09-01 09:52:44,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:44,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326950192] [2023-09-01 09:52:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:44,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326950192] [2023-09-01 09:52:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326950192] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963665494] [2023-09-01 09:52:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:44,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:44,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-09-01 09:52:44,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-09-01 09:52:44,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:44,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-09-01 09:52:44,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:45,485 INFO L130 PetriNetUnfolder]: 5301/7874 cut-off events. [2023-09-01 09:52:45,485 INFO L131 PetriNetUnfolder]: For 37538/39345 co-relation queries the response was YES. [2023-09-01 09:52:45,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33293 conditions, 7874 events. 5301/7874 cut-off events. For 37538/39345 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 47290 event pairs, 766 based on Foata normal form. 1420/9011 useless extension candidates. Maximal degree in co-relation 33268. Up to 3520 conditions per place. [2023-09-01 09:52:45,522 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 130 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2023-09-01 09:52:45,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 150 transitions, 1703 flow [2023-09-01 09:52:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-09-01 09:52:45,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042553191489362 [2023-09-01 09:52:45,524 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-09-01 09:52:45,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-09-01 09:52:45,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:45,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-09-01 09:52:45,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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-09-01 09:52:45,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:45,528 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:45,528 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 611 flow. Second operand 4 states and 474 transitions. [2023-09-01 09:52:45,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 150 transitions, 1703 flow [2023-09-01 09:52:45,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 150 transitions, 1630 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:45,564 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 642 flow [2023-09-01 09:52:45,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2023-09-01 09:52:45,565 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-09-01 09:52:45,565 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 642 flow [2023-09-01 09:52:45,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 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-09-01 09:52:45,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:45,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:45,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:52:45,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:45,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -404051366, now seen corresponding path program 1 times [2023-09-01 09:52:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131285982] [2023-09-01 09:52:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131285982] [2023-09-01 09:52:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131285982] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857846408] [2023-09-01 09:52:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:45,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:45,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:45,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-09-01 09:52:45,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-09-01 09:52:45,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:45,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-09-01 09:52:45,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:46,528 INFO L130 PetriNetUnfolder]: 4278/6562 cut-off events. [2023-09-01 09:52:46,529 INFO L131 PetriNetUnfolder]: For 31935/33906 co-relation queries the response was YES. [2023-09-01 09:52:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30533 conditions, 6562 events. 4278/6562 cut-off events. For 31935/33906 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 40568 event pairs, 582 based on Foata normal form. 1320/7630 useless extension candidates. Maximal degree in co-relation 30506. Up to 2725 conditions per place. [2023-09-01 09:52:46,561 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 165 selfloop transitions, 10 changer transitions 0/189 dead transitions. [2023-09-01 09:52:46,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 189 transitions, 2136 flow [2023-09-01 09:52:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-09-01 09:52:46,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2023-09-01 09:52:46,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-09-01 09:52:46,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-09-01 09:52:46,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:46,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-09-01 09:52:46,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 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-09-01 09:52:46,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:52:46,566 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 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-09-01 09:52:46,566 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 642 flow. Second operand 5 states and 595 transitions. [2023-09-01 09:52:46,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 189 transitions, 2136 flow [2023-09-01 09:52:46,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 189 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:46,595 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 719 flow [2023-09-01 09:52:46,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=719, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2023-09-01 09:52:46,596 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-09-01 09:52:46,596 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 719 flow [2023-09-01 09:52:46,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-09-01 09:52:46,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:46,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:52:46,598 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:46,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 123972030, now seen corresponding path program 1 times [2023-09-01 09:52:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622818630] [2023-09-01 09:52:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622818630] [2023-09-01 09:52:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622818630] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:47,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397037363] [2023-09-01 09:52:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:47,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:47,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:47,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-09-01 09:52:47,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 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-09-01 09:52:47,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:47,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-09-01 09:52:47,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:48,027 INFO L130 PetriNetUnfolder]: 6869/10293 cut-off events. [2023-09-01 09:52:48,027 INFO L131 PetriNetUnfolder]: For 46631/47750 co-relation queries the response was YES. [2023-09-01 09:52:48,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51475 conditions, 10293 events. 6869/10293 cut-off events. For 46631/47750 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 61081 event pairs, 1315 based on Foata normal form. 585/10829 useless extension candidates. Maximal degree in co-relation 51445. Up to 5143 conditions per place. [2023-09-01 09:52:48,059 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 98 selfloop transitions, 14 changer transitions 18/133 dead transitions. [2023-09-01 09:52:48,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 133 transitions, 1410 flow [2023-09-01 09:52:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2023-09-01 09:52:48,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925531914893617 [2023-09-01 09:52:48,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 463 transitions. [2023-09-01 09:52:48,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 463 transitions. [2023-09-01 09:52:48,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:48,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 463 transitions. [2023-09-01 09:52:48,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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-09-01 09:52:48,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:48,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:48,064 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 719 flow. Second operand 4 states and 463 transitions. [2023-09-01 09:52:48,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 133 transitions, 1410 flow [2023-09-01 09:52:48,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 1382 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:48,106 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 783 flow [2023-09-01 09:52:48,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=783, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-09-01 09:52:48,106 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-09-01 09:52:48,107 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 783 flow [2023-09-01 09:52:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 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-09-01 09:52:48,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:48,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:48,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:52:48,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:48,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 545105262, now seen corresponding path program 1 times [2023-09-01 09:52:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091478433] [2023-09-01 09:52:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091478433] [2023-09-01 09:52:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091478433] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787231282] [2023-09-01 09:52:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:48,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:48,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-09-01 09:52:48,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-09-01 09:52:48,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:48,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-09-01 09:52:48,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:48,687 INFO L130 PetriNetUnfolder]: 2081/3376 cut-off events. [2023-09-01 09:52:48,687 INFO L131 PetriNetUnfolder]: For 18823/19586 co-relation queries the response was YES. [2023-09-01 09:52:48,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16968 conditions, 3376 events. 2081/3376 cut-off events. For 18823/19586 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19985 event pairs, 226 based on Foata normal form. 647/3906 useless extension candidates. Maximal degree in co-relation 16936. Up to 1315 conditions per place. [2023-09-01 09:52:48,701 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 148 selfloop transitions, 14 changer transitions 16/191 dead transitions. [2023-09-01 09:52:48,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 2257 flow [2023-09-01 09:52:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-09-01 09:52:48,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049645390070922 [2023-09-01 09:52:48,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-09-01 09:52:48,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-09-01 09:52:48,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:48,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-09-01 09:52:48,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 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-09-01 09:52:48,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:48,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:48,707 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 783 flow. Second operand 6 states and 712 transitions. [2023-09-01 09:52:48,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 191 transitions, 2257 flow [2023-09-01 09:52:48,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 191 transitions, 2211 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:48,749 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 812 flow [2023-09-01 09:52:48,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=812, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2023-09-01 09:52:48,750 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-09-01 09:52:48,750 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 812 flow [2023-09-01 09:52:48,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 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-09-01 09:52:48,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:48,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:48,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:52:48,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:48,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 729285713, now seen corresponding path program 1 times [2023-09-01 09:52:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274755483] [2023-09-01 09:52:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274755483] [2023-09-01 09:52:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274755483] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421142833] [2023-09-01 09:52:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:48,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:48,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-09-01 09:52:48,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 812 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-09-01 09:52:48,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:48,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-09-01 09:52:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:49,303 INFO L130 PetriNetUnfolder]: 3218/5242 cut-off events. [2023-09-01 09:52:49,303 INFO L131 PetriNetUnfolder]: For 27229/27843 co-relation queries the response was YES. [2023-09-01 09:52:49,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27528 conditions, 5242 events. 3218/5242 cut-off events. For 27229/27843 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33292 event pairs, 414 based on Foata normal form. 356/5497 useless extension candidates. Maximal degree in co-relation 27495. Up to 2675 conditions per place. [2023-09-01 09:52:49,321 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 108 selfloop transitions, 2 changer transitions 46/166 dead transitions. [2023-09-01 09:52:49,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 166 transitions, 1923 flow [2023-09-01 09:52:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-09-01 09:52:49,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180851063829788 [2023-09-01 09:52:49,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-09-01 09:52:49,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-09-01 09:52:49,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:49,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-09-01 09:52:49,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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-09-01 09:52:49,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:49,326 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 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-09-01 09:52:49,326 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 812 flow. Second operand 4 states and 487 transitions. [2023-09-01 09:52:49,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 166 transitions, 1923 flow [2023-09-01 09:52:49,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 166 transitions, 1841 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:49,386 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 764 flow [2023-09-01 09:52:49,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=764, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-09-01 09:52:49,386 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-09-01 09:52:49,386 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 764 flow [2023-09-01 09:52:49,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-09-01 09:52:49,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:49,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:49,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:52:49,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:49,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1662989261, now seen corresponding path program 2 times [2023-09-01 09:52:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:49,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803240711] [2023-09-01 09:52:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:49,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803240711] [2023-09-01 09:52:49,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803240711] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:49,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:49,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:52:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529620017] [2023-09-01 09:52:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:49,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:49,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:49,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:49,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-09-01 09:52:49,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 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-09-01 09:52:49,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:49,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-09-01 09:52:49,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:49,992 INFO L130 PetriNetUnfolder]: 2653/4373 cut-off events. [2023-09-01 09:52:49,992 INFO L131 PetriNetUnfolder]: For 21286/22224 co-relation queries the response was YES. [2023-09-01 09:52:50,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21729 conditions, 4373 events. 2653/4373 cut-off events. For 21286/22224 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28435 event pairs, 222 based on Foata normal form. 671/4894 useless extension candidates. Maximal degree in co-relation 21695. Up to 1571 conditions per place. [2023-09-01 09:52:50,006 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 82 selfloop transitions, 18 changer transitions 60/167 dead transitions. [2023-09-01 09:52:50,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 167 transitions, 1945 flow [2023-09-01 09:52:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2023-09-01 09:52:50,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917933130699088 [2023-09-01 09:52:50,009 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 809 transitions. [2023-09-01 09:52:50,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 809 transitions. [2023-09-01 09:52:50,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:50,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 809 transitions. [2023-09-01 09:52:50,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-09-01 09:52:50,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:52:50,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 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-09-01 09:52:50,012 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 764 flow. Second operand 7 states and 809 transitions. [2023-09-01 09:52:50,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 167 transitions, 1945 flow [2023-09-01 09:52:50,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 1910 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:50,078 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 572 flow [2023-09-01 09:52:50,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-09-01 09:52:50,079 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-09-01 09:52:50,079 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 572 flow [2023-09-01 09:52:50,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 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-09-01 09:52:50,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:50,079 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, 1, 1, 1] [2023-09-01 09:52:50,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:52:50,080 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:50,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -655104347, now seen corresponding path program 1 times [2023-09-01 09:52:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704744759] [2023-09-01 09:52:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704744759] [2023-09-01 09:52:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704744759] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039111256] [2023-09-01 09:52:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:50,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:50,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-09-01 09:52:50,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 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-09-01 09:52:50,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:50,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-09-01 09:52:50,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:50,787 INFO L130 PetriNetUnfolder]: 743/1277 cut-off events. [2023-09-01 09:52:50,788 INFO L131 PetriNetUnfolder]: For 5963/6035 co-relation queries the response was YES. [2023-09-01 09:52:50,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6756 conditions, 1277 events. 743/1277 cut-off events. For 5963/6035 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6221 event pairs, 81 based on Foata normal form. 63/1338 useless extension candidates. Maximal degree in co-relation 6729. Up to 623 conditions per place. [2023-09-01 09:52:50,792 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 49 selfloop transitions, 6 changer transitions 78/135 dead transitions. [2023-09-01 09:52:50,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 1443 flow [2023-09-01 09:52:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-09-01 09:52:50,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47304964539007094 [2023-09-01 09:52:50,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-09-01 09:52:50,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-09-01 09:52:50,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:50,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-09-01 09:52:50,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 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-09-01 09:52:50,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:50,797 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 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-09-01 09:52:50,797 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 572 flow. Second operand 6 states and 667 transitions. [2023-09-01 09:52:50,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 1443 flow [2023-09-01 09:52:50,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 1251 flow, removed 30 selfloop flow, removed 13 redundant places. [2023-09-01 09:52:50,809 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 308 flow [2023-09-01 09:52:50,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2023-09-01 09:52:50,810 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-09-01 09:52:50,810 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 308 flow [2023-09-01 09:52:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 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-09-01 09:52:50,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:50,810 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, 1, 1, 1] [2023-09-01 09:52:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:52:50,811 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:50,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash 824964301, now seen corresponding path program 2 times [2023-09-01 09:52:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068613176] [2023-09-01 09:52:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:50,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:52:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:50,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:52:50,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:52:50,907 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:52:50,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:52:50,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:52:50,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:52:50,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:52:50,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:52:50,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:52:50,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 09:52:50,909 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:50,913 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:52:50,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:52:50,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:52:50 BasicIcfg [2023-09-01 09:52:50,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:52:50,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:52:50,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:52:50,980 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:52:50,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30" (3/4) ... [2023-09-01 09:52:50,982 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:52:51,047 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:52:51,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:52:51,048 INFO L158 Benchmark]: Toolchain (without parser) took 21253.07ms. Allocated memory was 83.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 60.0MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 422.9MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,048 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:52:51,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 3.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 53.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,050 INFO L158 Benchmark]: Boogie Preprocessor took 45.26ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,050 INFO L158 Benchmark]: RCFGBuilder took 485.69ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 48.7MB in the end (delta: 3.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,051 INFO L158 Benchmark]: TraceAbstraction took 20157.90ms. Allocated memory was 83.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 48.2MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,051 INFO L158 Benchmark]: Witness Printer took 67.59ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:52:51,052 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.14ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.84ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 56.9MB in the end (delta: 3.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 53.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.26ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.69ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 48.7MB in the end (delta: 3.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20157.90ms. Allocated memory was 83.9MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 48.2MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. * Witness Printer took 67.59ms. Allocated memory is still 2.6GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 133 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 27 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 6937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3620, independent: 3421, independent conditional: 0, independent unconditional: 3421, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1487, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3620, independent: 1979, independent conditional: 0, independent unconditional: 1979, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1487, unknown conditional: 0, unknown unconditional: 1487] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-4, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-3, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0: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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: 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: 837]: 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 9 procedures, 160 locations, 7 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: 20.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 751 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1305 IncrementalHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 66 mSDtfsCounter, 1305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=12, 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, 5.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-09-01 09:52:51,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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