./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:50:04,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:04,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:04,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:04,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:04,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:04,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:04,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:04,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:04,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:04,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:04,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:04,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:04,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:04,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:04,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:04,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:04,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:04,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:04,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:04,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:04,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:04,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:04,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:04,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:04,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:04,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:04,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:04,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:04,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:04,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:04,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:04,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:04,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:04,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:04,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:04,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:04,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:04,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:04,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:04,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:04,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:50:04,439 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:04,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:04,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:04,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:04,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:04,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:04,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:04,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:04,443 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:04,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:04,444 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:04,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:04,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:04,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:04,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:04,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:04,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:04,445 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:04,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:04,445 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:04,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:04,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:04,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:04,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:04,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:04,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:04,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:04,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:04,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:04,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:04,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:04,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:04,448 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:04,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:04,448 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:04,449 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 -> f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:50:04,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:04,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:04,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:04,780 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:04,780 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:04,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-08-30 16:50:05,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:06,132 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:06,132 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2023-08-30 16:50:06,146 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef549ea9/7aef94e389aa40a98881e99df11cd7fc/FLAG9aa416f50 [2023-08-30 16:50:06,160 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef549ea9/7aef94e389aa40a98881e99df11cd7fc [2023-08-30 16:50:06,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:06,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:06,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:06,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:06,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:06,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634f21e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06, skipping insertion in model container [2023-08-30 16:50:06,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:06,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:06,335 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/mix036_power.opt_rmo.opt.i[958,971] [2023-08-30 16:50:06,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:06,547 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:06,572 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/mix036_power.opt_rmo.opt.i[958,971] [2023-08-30 16:50:06,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:06,669 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:06,669 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:06,675 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:06,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06 WrapperNode [2023-08-30 16:50:06,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:06,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:06,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:06,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:06,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,743 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-30 16:50:06,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:06,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:06,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:06,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:06,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,789 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:06,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:06,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:06,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:06,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (1/1) ... [2023-08-30 16:50:06,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:06,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:50:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:50:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:06,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:06,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:06,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:06,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:06,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:06,877 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:50:07,063 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:07,064 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:07,325 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:07,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:07,512 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:07,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:07 BoogieIcfgContainer [2023-08-30 16:50:07,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:07,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:07,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:07,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:07,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:06" (1/3) ... [2023-08-30 16:50:07,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a18ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:07, skipping insertion in model container [2023-08-30 16:50:07,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:06" (2/3) ... [2023-08-30 16:50:07,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a18ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:07, skipping insertion in model container [2023-08-30 16:50:07,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:07" (3/3) ... [2023-08-30 16:50:07,521 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2023-08-30 16:50:07,539 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:07,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:07,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:07,549 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:07,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:50:07,766 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:50:07,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:07,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:50:07,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:50:07,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-30 16:50:07,786 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:07,797 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:50:07,799 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:50:07,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-30 16:50:07,825 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:50:07,825 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:07,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:50:07,828 INFO L119 LiptonReduction]: Number of co-enabled transitions 2954 [2023-08-30 16:50:11,941 INFO L134 LiptonReduction]: Checked pairs total: 7582 [2023-08-30 16:50:11,941 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-30 16:50:11,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:11,969 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;@71c85ca6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:11,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:11,981 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-08-30 16:50:11,984 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:11,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:11,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:11,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:11,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1667245551, now seen corresponding path program 1 times [2023-08-30 16:50:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456804789] [2023-08-30 16:50:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:12,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456804789] [2023-08-30 16:50:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456804789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:12,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:12,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113829026] [2023-08-30 16:50:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:12,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:12,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:12,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245 [2023-08-30 16:50:12,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:12,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:12,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245 [2023-08-30 16:50:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:13,141 INFO L130 PetriNetUnfolder]: 2855/4135 cut-off events. [2023-08-30 16:50:13,141 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-30 16:50:13,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 4135 events. 2855/4135 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20995 event pairs, 785 based on Foata normal form. 0/3894 useless extension candidates. Maximal degree in co-relation 8199. Up to 3103 conditions per place. [2023-08-30 16:50:13,171 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-30 16:50:13,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-08-30 16:50:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-30 16:50:13,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360544217687074 [2023-08-30 16:50:13,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-30 16:50:13,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-30 16:50:13,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:13,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-30 16:50:13,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:13,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:13,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:13,205 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 394 transitions. [2023-08-30 16:50:13,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-08-30 16:50:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:13,211 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-30 16:50:13,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-30 16:50:13,215 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 16:50:13,216 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-30 16:50:13,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:13,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:13,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:13,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:13,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:13,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash 964707134, now seen corresponding path program 1 times [2023-08-30 16:50:13,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27861474] [2023-08-30 16:50:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:13,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27861474] [2023-08-30 16:50:13,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27861474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:13,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:13,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383364810] [2023-08-30 16:50:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:13,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:13,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-08-30 16:50:13,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:13,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:13,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-08-30 16:50:13,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:14,436 INFO L130 PetriNetUnfolder]: 5895/8000 cut-off events. [2023-08-30 16:50:14,436 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2023-08-30 16:50:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16614 conditions, 8000 events. 5895/8000 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 34929 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16604. Up to 7809 conditions per place. [2023-08-30 16:50:14,472 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-08-30 16:50:14,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2023-08-30 16:50:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-30 16:50:14,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507482993197279 [2023-08-30 16:50:14,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-30 16:50:14,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-30 16:50:14,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:14,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-30 16:50:14,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:14,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:14,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:14,479 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 373 transitions. [2023-08-30 16:50:14,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2023-08-30 16:50:14,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:14,482 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2023-08-30 16:50:14,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-30 16:50:14,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 16:50:14,483 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2023-08-30 16:50:14,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:14,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:14,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:14,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:14,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:14,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1013693512, now seen corresponding path program 1 times [2023-08-30 16:50:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965179645] [2023-08-30 16:50:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965179645] [2023-08-30 16:50:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965179645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488735720] [2023-08-30 16:50:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:14,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:14,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-08-30 16:50:14,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:14,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:14,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-08-30 16:50:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:15,436 INFO L130 PetriNetUnfolder]: 5431/7392 cut-off events. [2023-08-30 16:50:15,436 INFO L131 PetriNetUnfolder]: For 1370/1370 co-relation queries the response was YES. [2023-08-30 16:50:15,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17043 conditions, 7392 events. 5431/7392 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 31506 event pairs, 1667 based on Foata normal form. 144/7536 useless extension candidates. Maximal degree in co-relation 17032. Up to 5105 conditions per place. [2023-08-30 16:50:15,480 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-30 16:50:15,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2023-08-30 16:50:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-30 16:50:15,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2023-08-30 16:50:15,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-30 16:50:15,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-30 16:50:15,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:15,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-30 16:50:15,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:15,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:15,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:15,487 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 369 transitions. [2023-08-30 16:50:15,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2023-08-30 16:50:15,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:15,489 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2023-08-30 16:50:15,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 16:50:15,490 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-30 16:50:15,490 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2023-08-30 16:50:15,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:15,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:15,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:15,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:15,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:15,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash -630592877, now seen corresponding path program 1 times [2023-08-30 16:50:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715139997] [2023-08-30 16:50:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715139997] [2023-08-30 16:50:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715139997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025265959] [2023-08-30 16:50:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:15,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:15,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-30 16:50:15,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:15,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:15,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-30 16:50:15,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:16,258 INFO L130 PetriNetUnfolder]: 3056/4566 cut-off events. [2023-08-30 16:50:16,259 INFO L131 PetriNetUnfolder]: For 711/736 co-relation queries the response was YES. [2023-08-30 16:50:16,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 4566 events. 3056/4566 cut-off events. For 711/736 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24576 event pairs, 571 based on Foata normal form. 336/4757 useless extension candidates. Maximal degree in co-relation 10105. Up to 2966 conditions per place. [2023-08-30 16:50:16,283 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2023-08-30 16:50:16,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 323 flow [2023-08-30 16:50:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-08-30 16:50:16,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134693877551021 [2023-08-30 16:50:16,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-08-30 16:50:16,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-08-30 16:50:16,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:16,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-08-30 16:50:16,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:16,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:16,291 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:16,292 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 5 states and 629 transitions. [2023-08-30 16:50:16,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 323 flow [2023-08-30 16:50:16,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:16,294 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2023-08-30 16:50:16,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-08-30 16:50:16,295 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-30 16:50:16,295 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 168 flow [2023-08-30 16:50:16,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:16,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:16,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:16,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:16,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -953131436, now seen corresponding path program 1 times [2023-08-30 16:50:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824684629] [2023-08-30 16:50:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824684629] [2023-08-30 16:50:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824684629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791215623] [2023-08-30 16:50:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:16,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:16,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-30 16:50:16,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:16,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:16,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-30 16:50:16,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:17,043 INFO L130 PetriNetUnfolder]: 2431/3782 cut-off events. [2023-08-30 16:50:17,043 INFO L131 PetriNetUnfolder]: For 1960/1963 co-relation queries the response was YES. [2023-08-30 16:50:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10988 conditions, 3782 events. 2431/3782 cut-off events. For 1960/1963 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20965 event pairs, 292 based on Foata normal form. 227/3905 useless extension candidates. Maximal degree in co-relation 10972. Up to 1257 conditions per place. [2023-08-30 16:50:17,068 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 72 selfloop transitions, 19 changer transitions 0/98 dead transitions. [2023-08-30 16:50:17,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 540 flow [2023-08-30 16:50:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-30 16:50:17,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-30 16:50:17,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-30 16:50:17,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-30 16:50:17,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:17,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-30 16:50:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:17,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:17,079 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:17,079 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 168 flow. Second operand 7 states and 882 transitions. [2023-08-30 16:50:17,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 540 flow [2023-08-30 16:50:17,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:17,092 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 297 flow [2023-08-30 16:50:17,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-08-30 16:50:17,095 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-30 16:50:17,095 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 297 flow [2023-08-30 16:50:17,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:17,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:17,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:17,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:17,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:17,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:17,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1202808706, now seen corresponding path program 1 times [2023-08-30 16:50:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792379454] [2023-08-30 16:50:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792379454] [2023-08-30 16:50:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792379454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182073599] [2023-08-30 16:50:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:17,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 245 [2023-08-30 16:50:17,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:17,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:17,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 245 [2023-08-30 16:50:17,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:18,040 INFO L130 PetriNetUnfolder]: 3681/5709 cut-off events. [2023-08-30 16:50:18,041 INFO L131 PetriNetUnfolder]: For 9681/9749 co-relation queries the response was YES. [2023-08-30 16:50:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20274 conditions, 5709 events. 3681/5709 cut-off events. For 9681/9749 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 33857 event pairs, 908 based on Foata normal form. 73/5504 useless extension candidates. Maximal degree in co-relation 20254. Up to 3004 conditions per place. [2023-08-30 16:50:18,064 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 71 selfloop transitions, 2 changer transitions 34/112 dead transitions. [2023-08-30 16:50:18,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 950 flow [2023-08-30 16:50:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-30 16:50:18,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2023-08-30 16:50:18,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-30 16:50:18,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-30 16:50:18,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:18,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-30 16:50:18,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 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-08-30 16:50:18,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:18,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:18,072 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 297 flow. Second operand 4 states and 515 transitions. [2023-08-30 16:50:18,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 950 flow [2023-08-30 16:50:18,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 815 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:18,204 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 232 flow [2023-08-30 16:50:18,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-30 16:50:18,206 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-30 16:50:18,206 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 232 flow [2023-08-30 16:50:18,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:18,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:18,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:18,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:18,208 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:18,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1429810782, now seen corresponding path program 2 times [2023-08-30 16:50:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:18,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451742] [2023-08-30 16:50:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:18,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:18,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:18,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451742] [2023-08-30 16:50:18,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:18,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:18,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057915018] [2023-08-30 16:50:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:18,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:18,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-30 16:50:18,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:18,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:18,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-30 16:50:18,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:19,094 INFO L130 PetriNetUnfolder]: 2360/3725 cut-off events. [2023-08-30 16:50:19,094 INFO L131 PetriNetUnfolder]: For 4857/4960 co-relation queries the response was YES. [2023-08-30 16:50:19,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11817 conditions, 3725 events. 2360/3725 cut-off events. For 4857/4960 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21298 event pairs, 274 based on Foata normal form. 208/3800 useless extension candidates. Maximal degree in co-relation 11796. Up to 929 conditions per place. [2023-08-30 16:50:19,115 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 79 selfloop transitions, 24 changer transitions 9/120 dead transitions. [2023-08-30 16:50:19,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 120 transitions, 755 flow [2023-08-30 16:50:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:50:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:50:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1129 transitions. [2023-08-30 16:50:19,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120181405895692 [2023-08-30 16:50:19,119 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1129 transitions. [2023-08-30 16:50:19,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1129 transitions. [2023-08-30 16:50:19,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:19,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1129 transitions. [2023-08-30 16:50:19,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:19,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:19,125 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 245.0) internal successors, (2450), 10 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:19,126 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 232 flow. Second operand 9 states and 1129 transitions. [2023-08-30 16:50:19,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 120 transitions, 755 flow [2023-08-30 16:50:19,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 745 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:19,171 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 399 flow [2023-08-30 16:50:19,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=399, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-08-30 16:50:19,172 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-30 16:50:19,172 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 399 flow [2023-08-30 16:50:19,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:19,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:19,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:19,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:19,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:19,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1626781978, now seen corresponding path program 1 times [2023-08-30 16:50:19,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:19,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949838256] [2023-08-30 16:50:19,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:19,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949838256] [2023-08-30 16:50:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949838256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:19,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:19,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551001727] [2023-08-30 16:50:19,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:19,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-30 16:50:19,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:19,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:19,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-30 16:50:19,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:20,152 INFO L130 PetriNetUnfolder]: 4908/7381 cut-off events. [2023-08-30 16:50:20,152 INFO L131 PetriNetUnfolder]: For 19227/19227 co-relation queries the response was YES. [2023-08-30 16:50:20,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27959 conditions, 7381 events. 4908/7381 cut-off events. For 19227/19227 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 40323 event pairs, 993 based on Foata normal form. 12/7393 useless extension candidates. Maximal degree in co-relation 27935. Up to 4860 conditions per place. [2023-08-30 16:50:20,186 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 96 selfloop transitions, 14 changer transitions 36/146 dead transitions. [2023-08-30 16:50:20,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 146 transitions, 1336 flow [2023-08-30 16:50:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-30 16:50:20,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506938775510204 [2023-08-30 16:50:20,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-30 16:50:20,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-30 16:50:20,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:20,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-30 16:50:20,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:20,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:20,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:20,195 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 399 flow. Second operand 5 states and 621 transitions. [2023-08-30 16:50:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 146 transitions, 1336 flow [2023-08-30 16:50:20,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 146 transitions, 1093 flow, removed 94 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:20,421 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 325 flow [2023-08-30 16:50:20,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-30 16:50:20,422 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-30 16:50:20,422 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 325 flow [2023-08-30 16:50:20,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:20,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:20,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:50:20,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:20,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1973600948, now seen corresponding path program 2 times [2023-08-30 16:50:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109833932] [2023-08-30 16:50:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109833932] [2023-08-30 16:50:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109833932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038357735] [2023-08-30 16:50:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:20,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:20,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-08-30 16:50:20,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:20,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:20,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-08-30 16:50:20,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:21,131 INFO L130 PetriNetUnfolder]: 2859/4453 cut-off events. [2023-08-30 16:50:21,131 INFO L131 PetriNetUnfolder]: For 8245/8245 co-relation queries the response was YES. [2023-08-30 16:50:21,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16295 conditions, 4453 events. 2859/4453 cut-off events. For 8245/8245 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23117 event pairs, 606 based on Foata normal form. 12/4465 useless extension candidates. Maximal degree in co-relation 16268. Up to 2338 conditions per place. [2023-08-30 16:50:21,147 INFO L137 encePairwiseOnDemand]: 237/245 looper letters, 80 selfloop transitions, 10 changer transitions 29/119 dead transitions. [2023-08-30 16:50:21,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 913 flow [2023-08-30 16:50:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-08-30 16:50:21,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49863945578231295 [2023-08-30 16:50:21,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-08-30 16:50:21,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-08-30 16:50:21,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:21,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-08-30 16:50:21,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,155 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,156 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 325 flow. Second operand 6 states and 733 transitions. [2023-08-30 16:50:21,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 913 flow [2023-08-30 16:50:21,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 873 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:21,206 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 298 flow [2023-08-30 16:50:21,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-08-30 16:50:21,207 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-30 16:50:21,207 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 298 flow [2023-08-30 16:50:21,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:21,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:21,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:50:21,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:21,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1810371690, now seen corresponding path program 3 times [2023-08-30 16:50:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:21,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627296485] [2023-08-30 16:50:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627296485] [2023-08-30 16:50:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627296485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:50:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067573415] [2023-08-30 16:50:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:21,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:21,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:21,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-30 16:50:21,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:21,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-30 16:50:21,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:21,821 INFO L130 PetriNetUnfolder]: 1649/2726 cut-off events. [2023-08-30 16:50:21,821 INFO L131 PetriNetUnfolder]: For 3814/3901 co-relation queries the response was YES. [2023-08-30 16:50:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9201 conditions, 2726 events. 1649/2726 cut-off events. For 3814/3901 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15453 event pairs, 302 based on Foata normal form. 79/2689 useless extension candidates. Maximal degree in co-relation 9175. Up to 1013 conditions per place. [2023-08-30 16:50:21,829 INFO L137 encePairwiseOnDemand]: 238/245 looper letters, 38 selfloop transitions, 18 changer transitions 30/92 dead transitions. [2023-08-30 16:50:21,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 644 flow [2023-08-30 16:50:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 985 transitions. [2023-08-30 16:50:21,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2023-08-30 16:50:21,833 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 985 transitions. [2023-08-30 16:50:21,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 985 transitions. [2023-08-30 16:50:21,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:21,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 985 transitions. [2023-08-30 16:50:21,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.125) internal successors, (985), 8 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,839 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,839 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 298 flow. Second operand 8 states and 985 transitions. [2023-08-30 16:50:21,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 644 flow [2023-08-30 16:50:21,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 582 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-30 16:50:21,886 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 263 flow [2023-08-30 16:50:21,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2023-08-30 16:50:21,887 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-30 16:50:21,887 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 263 flow [2023-08-30 16:50:21,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:21,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:21,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:21,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:50:21,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:21,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1558699265, now seen corresponding path program 1 times [2023-08-30 16:50:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665507147] [2023-08-30 16:50:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665507147] [2023-08-30 16:50:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665507147] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:22,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844854870] [2023-08-30 16:50:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:22,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:22,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-08-30 16:50:22,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:22,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-08-30 16:50:22,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:22,680 INFO L130 PetriNetUnfolder]: 1449/2386 cut-off events. [2023-08-30 16:50:22,681 INFO L131 PetriNetUnfolder]: For 5230/5230 co-relation queries the response was YES. [2023-08-30 16:50:22,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9159 conditions, 2386 events. 1449/2386 cut-off events. For 5230/5230 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12318 event pairs, 137 based on Foata normal form. 1/2387 useless extension candidates. Maximal degree in co-relation 9138. Up to 999 conditions per place. [2023-08-30 16:50:22,690 INFO L137 encePairwiseOnDemand]: 235/245 looper letters, 81 selfloop transitions, 11 changer transitions 56/148 dead transitions. [2023-08-30 16:50:22,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 148 transitions, 1302 flow [2023-08-30 16:50:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-08-30 16:50:22,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-30 16:50:22,694 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-08-30 16:50:22,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-08-30 16:50:22,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:22,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-08-30 16:50:22,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,700 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,700 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 263 flow. Second operand 7 states and 833 transitions. [2023-08-30 16:50:22,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 148 transitions, 1302 flow [2023-08-30 16:50:22,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 148 transitions, 1023 flow, removed 73 selfloop flow, removed 8 redundant places. [2023-08-30 16:50:22,732 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 263 flow [2023-08-30 16:50:22,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-08-30 16:50:22,733 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-30 16:50:22,733 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 263 flow [2023-08-30 16:50:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:22,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:22,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:22,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:50:22,734 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:22,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -636625893, now seen corresponding path program 2 times [2023-08-30 16:50:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127593674] [2023-08-30 16:50:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:23,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127593674] [2023-08-30 16:50:23,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127593674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:23,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:23,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:50:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838955222] [2023-08-30 16:50:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:23,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:50:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:50:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:50:23,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-08-30 16:50:23,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:23,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-08-30 16:50:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:23,665 INFO L130 PetriNetUnfolder]: 1781/2910 cut-off events. [2023-08-30 16:50:23,665 INFO L131 PetriNetUnfolder]: For 5575/5575 co-relation queries the response was YES. [2023-08-30 16:50:23,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 2910 events. 1781/2910 cut-off events. For 5575/5575 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15801 event pairs, 280 based on Foata normal form. 2/2912 useless extension candidates. Maximal degree in co-relation 11000. Up to 934 conditions per place. [2023-08-30 16:50:23,676 INFO L137 encePairwiseOnDemand]: 236/245 looper letters, 43 selfloop transitions, 3 changer transitions 114/160 dead transitions. [2023-08-30 16:50:23,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 160 transitions, 1250 flow [2023-08-30 16:50:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:50:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:50:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1157 transitions. [2023-08-30 16:50:23,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722448979591837 [2023-08-30 16:50:23,680 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1157 transitions. [2023-08-30 16:50:23,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1157 transitions. [2023-08-30 16:50:23,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:23,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1157 transitions. [2023-08-30 16:50:23,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.7) internal successors, (1157), 10 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,688 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 245.0) internal successors, (2695), 11 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,688 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 263 flow. Second operand 10 states and 1157 transitions. [2023-08-30 16:50:23,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 160 transitions, 1250 flow [2023-08-30 16:50:23,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 160 transitions, 1173 flow, removed 33 selfloop flow, removed 5 redundant places. [2023-08-30 16:50:23,735 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 231 flow [2023-08-30 16:50:23,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2023-08-30 16:50:23,736 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-08-30 16:50:23,737 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 231 flow [2023-08-30 16:50:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:23,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:23,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:23,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:50:23,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:23,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1031175709, now seen corresponding path program 3 times [2023-08-30 16:50:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743324355] [2023-08-30 16:50:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743324355] [2023-08-30 16:50:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743324355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:24,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791610691] [2023-08-30 16:50:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:24,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:24,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-08-30 16:50:24,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 42 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:24,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:24,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-08-30 16:50:24,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:24,853 INFO L130 PetriNetUnfolder]: 552/944 cut-off events. [2023-08-30 16:50:24,853 INFO L131 PetriNetUnfolder]: For 1695/1720 co-relation queries the response was YES. [2023-08-30 16:50:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 944 events. 552/944 cut-off events. For 1695/1720 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4266 event pairs, 72 based on Foata normal form. 15/936 useless extension candidates. Maximal degree in co-relation 3452. Up to 590 conditions per place. [2023-08-30 16:50:24,856 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 44 selfloop transitions, 4 changer transitions 28/80 dead transitions. [2023-08-30 16:50:24,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 585 flow [2023-08-30 16:50:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-30 16:50:24,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862973760932945 [2023-08-30 16:50:24,859 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-30 16:50:24,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-30 16:50:24,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:24,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-30 16:50:24,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:24,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:24,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:24,865 INFO L175 Difference]: Start difference. First operand has 70 places, 42 transitions, 231 flow. Second operand 7 states and 834 transitions. [2023-08-30 16:50:24,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 585 flow [2023-08-30 16:50:24,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 559 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-30 16:50:24,872 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 210 flow [2023-08-30 16:50:24,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-08-30 16:50:24,873 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-30 16:50:24,873 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 210 flow [2023-08-30 16:50:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:24,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:24,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:24,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:50:24,875 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:24,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1867670091, now seen corresponding path program 4 times [2023-08-30 16:50:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754191263] [2023-08-30 16:50:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:24,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:24,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:24,980 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:24,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:50:24,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:50:24,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:50:24,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:50:24,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:50:24,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:50:24,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:50:24,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:50:24,984 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2023-08-30 16:50:24,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:24,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:25,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:25 BasicIcfg [2023-08-30 16:50:25,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:25,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:25,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:25,048 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:25,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:07" (3/4) ... [2023-08-30 16:50:25,050 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:25,113 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:25,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:25,114 INFO L158 Benchmark]: Toolchain (without parser) took 18950.72ms. Allocated memory was 73.4MB in the beginning and 947.9MB in the end (delta: 874.5MB). Free memory was 50.0MB in the beginning and 757.7MB in the end (delta: -707.7MB). Peak memory consumption was 169.0MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,114 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:25,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.37ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 43.2MB in the end (delta: 6.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.87ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,115 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 73.4MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,116 INFO L158 Benchmark]: RCFGBuilder took 710.22ms. Allocated memory is still 73.4MB. Free memory was 38.7MB in the beginning and 44.3MB in the end (delta: -5.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,116 INFO L158 Benchmark]: TraceAbstraction took 17531.40ms. Allocated memory was 73.4MB in the beginning and 947.9MB in the end (delta: 874.5MB). Free memory was 43.5MB in the beginning and 773.5MB in the end (delta: -730.0MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,116 INFO L158 Benchmark]: Witness Printer took 66.00ms. Allocated memory is still 947.9MB. Free memory was 773.5MB in the beginning and 757.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:25,117 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.09ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.37ms. Allocated memory is still 73.4MB. Free memory was 49.8MB in the beginning and 43.2MB in the end (delta: 6.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.87ms. Allocated memory is still 73.4MB. Free memory was 43.2MB in the beginning and 40.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 73.4MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 710.22ms. Allocated memory is still 73.4MB. Free memory was 38.7MB in the beginning and 44.3MB in the end (delta: -5.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17531.40ms. Allocated memory was 73.4MB in the beginning and 947.9MB in the end (delta: 874.5MB). Free memory was 43.5MB in the beginning and 773.5MB in the end (delta: -730.0MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. * Witness Printer took 66.00ms. Allocated memory is still 947.9MB. Free memory was 773.5MB in the beginning and 757.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 139 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 29 TransitionsAfterwards, 2954 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 7582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3753, independent: 3539, independent conditional: 0, independent unconditional: 3539, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3753, independent: 1925, independent conditional: 0, independent unconditional: 1925, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t941, ((void *)0), P0, ((void *)0))=-2, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t942, ((void *)0), P1, ((void *)0))=-1, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t943, ((void *)0), P2, ((void *)0))=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t944, ((void *)0), P3, ((void *)0))=1, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 1 [L832] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 864]: 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: 870]: 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: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 812 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1815 IncrementalHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 115 mSDtfsCounter, 1815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=7, InterpolantAutomatonStates: 77, 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.8s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:50:25,140 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