./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix010.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/mix010.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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --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:42:45,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:42:45,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:42:46,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:42:46,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:42:46,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:42:46,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:42:46,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:42:46,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:42:46,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:42:46,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:42:46,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:42:46,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:42:46,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:42:46,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:42:46,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:42:46,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:42:46,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:42:46,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:42:46,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:42:46,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:42:46,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:42:46,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:42:46,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:42:46,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:42:46,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:42:46,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:42:46,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:42:46,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:42:46,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:42:46,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:42:46,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:42:46,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:42:46,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:42:46,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:42:46,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:42:46,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:42:46,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:42:46,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:42:46,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:42:46,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:42:46,071 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:42:46,103 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:42:46,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:42:46,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:42:46,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:42:46,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:42:46,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:42:46,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:42:46,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:42:46,106 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:42:46,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:42:46,107 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:42:46,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:42:46,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:42:46,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:42:46,109 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:42:46,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:42:46,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:42:46,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:42:46,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:42:46,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:42:46,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:42:46,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:42:46,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:42:46,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:42:46,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:42:46,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:42:46,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:42:46,111 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:42:46,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:42:46,112 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:42:46,112 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a 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:42:46,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:42:46,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:42:46,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:42:46,418 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:42:46,419 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:42:46,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2023-09-01 09:42:47,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:42:47,737 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:42:47,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2023-09-01 09:42:47,747 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d6e6d5c/f06a445dc4584738916d23895bc8344e/FLAG8d4296451 [2023-09-01 09:42:47,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d6e6d5c/f06a445dc4584738916d23895bc8344e [2023-09-01 09:42:47,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:42:47,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:42:47,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:42:47,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:42:47,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:42:47,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:42:47" (1/1) ... [2023-09-01 09:42:47,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2b42b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:47, skipping insertion in model container [2023-09-01 09:42:47,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:42:47" (1/1) ... [2023-09-01 09:42:47,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:42:47,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:42:47,925 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/mix010.opt.i[944,957] [2023-09-01 09:42:48,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:42:48,134 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:42:48,144 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/mix010.opt.i[944,957] [2023-09-01 09:42:48,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:42:48,220 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:42:48,220 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:42:48,226 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:42:48,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48 WrapperNode [2023-09-01 09:42:48,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:42:48,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:42:48,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:42:48,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:42:48,233 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:42:48" (1/1) ... [2023-09-01 09:42:48,257 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:42:48" (1/1) ... [2023-09-01 09:42:48,298 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-09-01 09:42:48,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:42:48,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:42:48,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:42:48,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:42:48,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:42:48,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:42:48,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:42:48,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:42:48,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (1/1) ... [2023-09-01 09:42:48,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:42:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:42:48,382 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:42:48,408 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:42:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:42:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:42:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:42:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:42:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:42:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:42:48,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:42:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:42:48,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:42:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:42:48,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:42:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:42:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:42:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:42:48,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:42:48,430 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:42:48,556 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:42:48,571 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:42:48,876 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:42:49,116 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:42:49,116 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:42:49,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:42:49 BoogieIcfgContainer [2023-09-01 09:42:49,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:42:49,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:42:49,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:42:49,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:42:49,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:42:47" (1/3) ... [2023-09-01 09:42:49,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f313da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:42:49, skipping insertion in model container [2023-09-01 09:42:49,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:42:48" (2/3) ... [2023-09-01 09:42:49,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f313da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:42:49, skipping insertion in model container [2023-09-01 09:42:49,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:42:49" (3/3) ... [2023-09-01 09:42:49,132 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2023-09-01 09:42:49,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:42:49,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:42:49,148 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:42:49,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:42:49,216 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:42:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2023-09-01 09:42:49,321 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-09-01 09:42:49,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:42:49,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-09-01 09:42:49,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2023-09-01 09:42:49,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-09-01 09:42:49,335 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:42:49,352 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-09-01 09:42:49,358 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-09-01 09:42:49,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-09-01 09:42:49,400 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2023-09-01 09:42:49,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:42:49,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-09-01 09:42:49,404 INFO L119 LiptonReduction]: Number of co-enabled transitions 1962 [2023-09-01 09:42:53,079 INFO L134 LiptonReduction]: Checked pairs total: 4943 [2023-09-01 09:42:53,079 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-09-01 09:42:53,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:42:53,096 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;@17eab50e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:42:53,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:42:53,100 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-09-01 09:42:53,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:42:53,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:53,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:53,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:53,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1485482236, now seen corresponding path program 1 times [2023-09-01 09:42:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075834873] [2023-09-01 09:42:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:53,567 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:42:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:53,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075834873] [2023-09-01 09:42:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075834873] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:42:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097292552] [2023-09-01 09:42:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:53,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:42:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:42:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:42:53,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2023-09-01 09:42:53,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:42:53,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:53,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2023-09-01 09:42:53,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:53,823 INFO L130 PetriNetUnfolder]: 824/1313 cut-off events. [2023-09-01 09:42:53,823 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-09-01 09:42:53,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1313 events. 824/1313 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6224 event pairs, 144 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 2581. Up to 981 conditions per place. [2023-09-01 09:42:53,832 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-09-01 09:42:53,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2023-09-01 09:42:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:42:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:42:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-09-01 09:42:53,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211267605633803 [2023-09-01 09:42:53,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-09-01 09:42:53,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-09-01 09:42:53,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:53,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-09-01 09:42:53,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 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:42:53,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:53,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:53,856 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 333 transitions. [2023-09-01 09:42:53,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2023-09-01 09:42:53,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:42:53,860 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-09-01 09:42:53,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-09-01 09:42:53,864 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-09-01 09:42:53,864 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-09-01 09:42:53,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:42:53,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:53,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:53,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:42:53,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:53,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1619226412, now seen corresponding path program 1 times [2023-09-01 09:42:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618150013] [2023-09-01 09:42:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:54,221 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:42:54,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618150013] [2023-09-01 09:42:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618150013] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:42:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44232108] [2023-09-01 09:42:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:54,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:42:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:42:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:42:54,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 213 [2023-09-01 09:42:54,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:42:54,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:54,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 213 [2023-09-01 09:42:54,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:54,462 INFO L130 PetriNetUnfolder]: 1069/1590 cut-off events. [2023-09-01 09:42:54,462 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-09-01 09:42:54,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1590 events. 1069/1590 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6322 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3300. Up to 1515 conditions per place. [2023-09-01 09:42:54,470 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2023-09-01 09:42:54,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2023-09-01 09:42:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:42:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:42:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-09-01 09:42:54,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48982785602503914 [2023-09-01 09:42:54,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:54,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:42:54,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:54,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:54,477 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 313 transitions. [2023-09-01 09:42:54,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2023-09-01 09:42:54,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:42:54,479 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2023-09-01 09:42:54,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-09-01 09:42:54,480 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-09-01 09:42:54,480 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2023-09-01 09:42:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:42:54,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:54,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:54,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:42:54,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:54,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1094117148, now seen corresponding path program 1 times [2023-09-01 09:42:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301096405] [2023-09-01 09:42:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:54,703 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:42:54,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:54,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301096405] [2023-09-01 09:42:54,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301096405] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:54,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:54,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:42:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375802261] [2023-09-01 09:42:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:42:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:42:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:42:54,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 213 [2023-09-01 09:42:54,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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:42:54,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:54,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 213 [2023-09-01 09:42:54,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:54,914 INFO L130 PetriNetUnfolder]: 969/1450 cut-off events. [2023-09-01 09:42:54,914 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2023-09-01 09:42:54,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1450 events. 969/1450 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5789 event pairs, 375 based on Foata normal form. 40/1490 useless extension candidates. Maximal degree in co-relation 3334. Up to 1003 conditions per place. [2023-09-01 09:42:54,923 INFO L137 encePairwiseOnDemand]: 210/213 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-09-01 09:42:54,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 176 flow [2023-09-01 09:42:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:42:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:42:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-09-01 09:42:54,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48982785602503914 [2023-09-01 09:42:54,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:54,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-09-01 09:42:54,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:42:54,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:54,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:54,931 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 313 transitions. [2023-09-01 09:42:54,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 176 flow [2023-09-01 09:42:54,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:42:54,932 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2023-09-01 09:42:54,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-09-01 09:42:54,934 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-09-01 09:42:54,936 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2023-09-01 09:42:54,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 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:42:54,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:54,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:42:54,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:54,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash -220788329, now seen corresponding path program 1 times [2023-09-01 09:42:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898946923] [2023-09-01 09:42:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:55,102 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:42:55,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:55,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898946923] [2023-09-01 09:42:55,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898946923] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:55,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:55,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:42:55,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175710339] [2023-09-01 09:42:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:55,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:42:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:42:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:42:55,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2023-09-01 09:42:55,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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:42:55,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:55,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2023-09-01 09:42:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:55,254 INFO L130 PetriNetUnfolder]: 669/1098 cut-off events. [2023-09-01 09:42:55,254 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-09-01 09:42:55,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 1098 events. 669/1098 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4777 event pairs, 247 based on Foata normal form. 24/1121 useless extension candidates. Maximal degree in co-relation 2510. Up to 637 conditions per place. [2023-09-01 09:42:55,260 INFO L137 encePairwiseOnDemand]: 210/213 looper letters, 26 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-09-01 09:42:55,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 160 flow [2023-09-01 09:42:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:42:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:42:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-09-01 09:42:55,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513302034428795 [2023-09-01 09:42:55,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-09-01 09:42:55,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-09-01 09:42:55,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:55,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-09-01 09:42:55,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:42:55,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:55,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:42:55,265 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 328 transitions. [2023-09-01 09:42:55,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 160 flow [2023-09-01 09:42:55,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:42:55,267 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2023-09-01 09:42:55,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-09-01 09:42:55,268 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-09-01 09:42:55,268 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2023-09-01 09:42:55,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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:42:55,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:55,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:55,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:42:55,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:55,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash -773689106, now seen corresponding path program 1 times [2023-09-01 09:42:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023385900] [2023-09-01 09:42:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:55,459 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:42:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023385900] [2023-09-01 09:42:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023385900] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:42:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828187144] [2023-09-01 09:42:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:55,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:42:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:42:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:42:55,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2023-09-01 09:42:55,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:42:55,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:55,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2023-09-01 09:42:55,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:55,649 INFO L130 PetriNetUnfolder]: 528/905 cut-off events. [2023-09-01 09:42:55,650 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2023-09-01 09:42:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 905 events. 528/905 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4153 event pairs, 100 based on Foata normal form. 96/999 useless extension candidates. Maximal degree in co-relation 2204. Up to 495 conditions per place. [2023-09-01 09:42:55,655 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 49 selfloop transitions, 7 changer transitions 2/61 dead transitions. [2023-09-01 09:42:55,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 312 flow [2023-09-01 09:42:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:42:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:42:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-09-01 09:42:55,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032863849765258 [2023-09-01 09:42:55,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-09-01 09:42:55,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-09-01 09:42:55,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:55,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-09-01 09:42:55,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:42:55,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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:42:55,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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:42:55,662 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 536 transitions. [2023-09-01 09:42:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 312 flow [2023-09-01 09:42:55,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:42:55,665 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 134 flow [2023-09-01 09:42:55,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-09-01 09:42:55,666 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-09-01 09:42:55,666 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 134 flow [2023-09-01 09:42:55,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:42:55,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:55,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:42:55,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:55,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1540079389, now seen corresponding path program 1 times [2023-09-01 09:42:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148233503] [2023-09-01 09:42:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:55,944 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:42:55,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:55,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148233503] [2023-09-01 09:42:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148233503] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:42:55,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150470677] [2023-09-01 09:42:55,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:55,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:42:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:42:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:42:55,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2023-09-01 09:42:55,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:42:55,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:55,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2023-09-01 09:42:55,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:56,175 INFO L130 PetriNetUnfolder]: 390/707 cut-off events. [2023-09-01 09:42:56,175 INFO L131 PetriNetUnfolder]: For 429/429 co-relation queries the response was YES. [2023-09-01 09:42:56,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 707 events. 390/707 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3218 event pairs, 66 based on Foata normal form. 52/757 useless extension candidates. Maximal degree in co-relation 2148. Up to 233 conditions per place. [2023-09-01 09:42:56,180 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 57 selfloop transitions, 13 changer transitions 10/83 dead transitions. [2023-09-01 09:42:56,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 480 flow [2023-09-01 09:42:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:42:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:42:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2023-09-01 09:42:56,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030181086519114 [2023-09-01 09:42:56,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2023-09-01 09:42:56,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2023-09-01 09:42:56,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:56,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2023-09-01 09:42:56,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 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:42:56,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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:42:56,191 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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:42:56,191 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 134 flow. Second operand 7 states and 750 transitions. [2023-09-01 09:42:56,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 480 flow [2023-09-01 09:42:56,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:42:56,197 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 218 flow [2023-09-01 09:42:56,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-09-01 09:42:56,202 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-09-01 09:42:56,202 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 218 flow [2023-09-01 09:42:56,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:42:56,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:56,203 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:42:56,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:42:56,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:56,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -440166737, now seen corresponding path program 1 times [2023-09-01 09:42:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312999319] [2023-09-01 09:42:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:56,460 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:42:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:56,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312999319] [2023-09-01 09:42:56,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312999319] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:42:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027566552] [2023-09-01 09:42:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:56,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:42:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:42:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:42:56,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2023-09-01 09:42:56,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:42:56,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:56,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2023-09-01 09:42:56,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:56,677 INFO L130 PetriNetUnfolder]: 354/646 cut-off events. [2023-09-01 09:42:56,678 INFO L131 PetriNetUnfolder]: For 889/889 co-relation queries the response was YES. [2023-09-01 09:42:56,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 646 events. 354/646 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2923 event pairs, 63 based on Foata normal form. 12/656 useless extension candidates. Maximal degree in co-relation 2189. Up to 207 conditions per place. [2023-09-01 09:42:56,682 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 54 selfloop transitions, 17 changer transitions 9/83 dead transitions. [2023-09-01 09:42:56,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 538 flow [2023-09-01 09:42:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:42:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:42:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2023-09-01 09:42:56,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49139280125195617 [2023-09-01 09:42:56,686 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 942 transitions. [2023-09-01 09:42:56,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 942 transitions. [2023-09-01 09:42:56,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:56,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 942 transitions. [2023-09-01 09:42:56,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 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:42:56,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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:42:56,691 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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:42:56,692 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 218 flow. Second operand 9 states and 942 transitions. [2023-09-01 09:42:56,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 538 flow [2023-09-01 09:42:56,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 484 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-09-01 09:42:56,703 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 232 flow [2023-09-01 09:42:56,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-09-01 09:42:56,703 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2023-09-01 09:42:56,704 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 232 flow [2023-09-01 09:42:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:42:56,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:56,704 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:42:56,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:42:56,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:56,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1885919109, now seen corresponding path program 1 times [2023-09-01 09:42:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:56,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811654426] [2023-09-01 09:42:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:57,013 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:42:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811654426] [2023-09-01 09:42:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811654426] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:42:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443693782] [2023-09-01 09:42:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:57,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:42:57,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:42:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:42:57,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2023-09-01 09:42:57,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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:42:57,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:57,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2023-09-01 09:42:57,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:57,252 INFO L130 PetriNetUnfolder]: 635/1081 cut-off events. [2023-09-01 09:42:57,252 INFO L131 PetriNetUnfolder]: For 1994/1994 co-relation queries the response was YES. [2023-09-01 09:42:57,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 1081 events. 635/1081 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5001 event pairs, 72 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 3653. Up to 690 conditions per place. [2023-09-01 09:42:57,257 INFO L137 encePairwiseOnDemand]: 205/213 looper letters, 56 selfloop transitions, 12 changer transitions 27/95 dead transitions. [2023-09-01 09:42:57,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 95 transitions, 773 flow [2023-09-01 09:42:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:42:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:42:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2023-09-01 09:42:57,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835680751173709 [2023-09-01 09:42:57,260 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2023-09-01 09:42:57,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2023-09-01 09:42:57,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:57,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2023-09-01 09:42:57,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 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:42:57,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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:42:57,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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:42:57,264 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 232 flow. Second operand 5 states and 515 transitions. [2023-09-01 09:42:57,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 95 transitions, 773 flow [2023-09-01 09:42:57,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 95 transitions, 634 flow, removed 30 selfloop flow, removed 8 redundant places. [2023-09-01 09:42:57,276 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 198 flow [2023-09-01 09:42:57,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-09-01 09:42:57,277 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-09-01 09:42:57,277 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 198 flow [2023-09-01 09:42:57,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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:42:57,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:57,278 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:42:57,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:42:57,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:57,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2075255191, now seen corresponding path program 2 times [2023-09-01 09:42:57,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:57,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852469604] [2023-09-01 09:42:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:57,514 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:42:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852469604] [2023-09-01 09:42:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852469604] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:57,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:42:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153729439] [2023-09-01 09:42:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:42:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:42:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:42:57,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2023-09-01 09:42:57,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:42:57,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:57,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2023-09-01 09:42:57,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:57,724 INFO L130 PetriNetUnfolder]: 380/691 cut-off events. [2023-09-01 09:42:57,725 INFO L131 PetriNetUnfolder]: For 911/911 co-relation queries the response was YES. [2023-09-01 09:42:57,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 691 events. 380/691 cut-off events. For 911/911 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3023 event pairs, 44 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 2378. Up to 363 conditions per place. [2023-09-01 09:42:57,729 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 45 selfloop transitions, 5 changer transitions 35/85 dead transitions. [2023-09-01 09:42:57,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 596 flow [2023-09-01 09:42:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:42:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:42:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2023-09-01 09:42:57,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4749608763693271 [2023-09-01 09:42:57,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 607 transitions. [2023-09-01 09:42:57,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions. [2023-09-01 09:42:57,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:57,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions. [2023-09-01 09:42:57,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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:42:57,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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:42:57,735 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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:42:57,735 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 198 flow. Second operand 6 states and 607 transitions. [2023-09-01 09:42:57,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 596 flow [2023-09-01 09:42:57,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 580 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-09-01 09:42:57,741 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 193 flow [2023-09-01 09:42:57,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-09-01 09:42:57,742 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-09-01 09:42:57,742 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 193 flow [2023-09-01 09:42:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:42:57,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:57,742 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:42:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:42:57,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:57,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -165087673, now seen corresponding path program 3 times [2023-09-01 09:42:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110110054] [2023-09-01 09:42:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:42:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:58,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110110054] [2023-09-01 09:42:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110110054] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:42:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586992994] [2023-09-01 09:42:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:58,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:42:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:42:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:42:58,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2023-09-01 09:42:58,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:42:58,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:58,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2023-09-01 09:42:58,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:58,161 INFO L130 PetriNetUnfolder]: 226/454 cut-off events. [2023-09-01 09:42:58,161 INFO L131 PetriNetUnfolder]: For 675/675 co-relation queries the response was YES. [2023-09-01 09:42:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 454 events. 226/454 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1953 event pairs, 68 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 1571. Up to 230 conditions per place. [2023-09-01 09:42:58,163 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 26 selfloop transitions, 3 changer transitions 39/68 dead transitions. [2023-09-01 09:42:58,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 473 flow [2023-09-01 09:42:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:42:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:42:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-09-01 09:42:58,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46870109546165883 [2023-09-01 09:42:58,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-09-01 09:42:58,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-09-01 09:42:58,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:58,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-09-01 09:42:58,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 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:42:58,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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:42:58,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 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:42:58,171 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 193 flow. Second operand 6 states and 599 transitions. [2023-09-01 09:42:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 473 flow [2023-09-01 09:42:58,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 467 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:42:58,176 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 138 flow [2023-09-01 09:42:58,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-09-01 09:42:58,178 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-09-01 09:42:58,178 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 138 flow [2023-09-01 09:42:58,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 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:42:58,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:58,179 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:42:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:42:58,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:58,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 522154903, now seen corresponding path program 4 times [2023-09-01 09:42:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993363289] [2023-09-01 09:42:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:42:59,169 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:42:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:42:59,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993363289] [2023-09-01 09:42:59,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993363289] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:42:59,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:42:59,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:42:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468217834] [2023-09-01 09:42:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:42:59,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:42:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:42:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:42:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:42:59,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2023-09-01 09:42:59,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 27 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:42:59,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:42:59,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2023-09-01 09:42:59,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:42:59,511 INFO L130 PetriNetUnfolder]: 76/178 cut-off events. [2023-09-01 09:42:59,511 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2023-09-01 09:42:59,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 178 events. 76/178 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 673 event pairs, 14 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 628. Up to 83 conditions per place. [2023-09-01 09:42:59,512 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 24 selfloop transitions, 5 changer transitions 16/47 dead transitions. [2023-09-01 09:42:59,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 339 flow [2023-09-01 09:42:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:42:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:42:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 792 transitions. [2023-09-01 09:42:59,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647887323943662 [2023-09-01 09:42:59,515 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 792 transitions. [2023-09-01 09:42:59,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 792 transitions. [2023-09-01 09:42:59,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:42:59,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 792 transitions. [2023-09-01 09:42:59,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 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:42:59,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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:42:59,525 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 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:42:59,525 INFO L175 Difference]: Start difference. First operand has 51 places, 27 transitions, 138 flow. Second operand 8 states and 792 transitions. [2023-09-01 09:42:59,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 339 flow [2023-09-01 09:42:59,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 310 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-09-01 09:42:59,528 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 133 flow [2023-09-01 09:42:59,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-09-01 09:42:59,529 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-09-01 09:42:59,529 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 133 flow [2023-09-01 09:42:59,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 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:42:59,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:42:59,530 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:42:59,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:42:59,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:42:59,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:42:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1956847361, now seen corresponding path program 5 times [2023-09-01 09:42:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:42:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795712016] [2023-09-01 09:42:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:42:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:42:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:42:59,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:42:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:42:59,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:42:59,677 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:42:59,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:42:59,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:42:59,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:42:59,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:42:59,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:42:59,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:42:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:42:59,685 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:42:59,689 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:42:59,690 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:42:59,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:42:59 BasicIcfg [2023-09-01 09:42:59,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:42:59,772 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:42:59,772 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:42:59,772 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:42:59,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:42:49" (3/4) ... [2023-09-01 09:42:59,774 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:42:59,854 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:42:59,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:42:59,854 INFO L158 Benchmark]: Toolchain (without parser) took 12091.06ms. Allocated memory was 75.5MB in the beginning and 293.6MB in the end (delta: 218.1MB). Free memory was 51.4MB in the beginning and 213.0MB in the end (delta: -161.7MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,855 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:42:59,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.20ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 47.1MB in the end (delta: 4.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.96ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 44.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,856 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 75.5MB. Free memory was 44.3MB in the beginning and 42.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,857 INFO L158 Benchmark]: RCFGBuilder took 764.40ms. Allocated memory is still 75.5MB. Free memory was 42.3MB in the beginning and 28.3MB in the end (delta: 13.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,857 INFO L158 Benchmark]: TraceAbstraction took 10645.40ms. Allocated memory was 92.3MB in the beginning and 293.6MB in the end (delta: 201.3MB). Free memory was 68.3MB in the beginning and 224.5MB in the end (delta: -156.3MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,857 INFO L158 Benchmark]: Witness Printer took 82.07ms. Allocated memory is still 293.6MB. Free memory was 223.5MB in the beginning and 213.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 09:42:59,859 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.17ms. Allocated memory is still 58.7MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.20ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 47.1MB in the end (delta: 4.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.96ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 44.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 75.5MB. Free memory was 44.3MB in the beginning and 42.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.40ms. Allocated memory is still 75.5MB. Free memory was 42.3MB in the beginning and 28.3MB in the end (delta: 13.9MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10645.40ms. Allocated memory was 92.3MB in the beginning and 293.6MB in the end (delta: 201.3MB). Free memory was 68.3MB in the beginning and 224.5MB in the end (delta: -156.3MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 82.07ms. Allocated memory is still 293.6MB. Free memory was 223.5MB in the beginning and 213.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 118 PlacesBefore, 33 PlacesAfterwards, 110 TransitionsBefore, 24 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 4943 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2511, independent: 2329, independent conditional: 0, independent unconditional: 2329, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1087, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2511, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1087, unknown conditional: 0, unknown unconditional: 1087] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-1, t260={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=0, t260={5:0}, t261={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=1, t260={5:0}, t261={6:0}, t262={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 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) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 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 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 443 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1023 IncrementalHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 35 mSDtfsCounter, 1023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=7, InterpolantAutomatonStates: 58, 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, 3.1s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:42:59,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE