./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.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 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:47:59,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:47:59,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:47:59,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:47:59,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:47:59,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:47:59,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:47:59,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:47:59,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:47:59,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:47:59,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:47:59,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:47:59,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:47:59,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:47:59,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:47:59,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:47:59,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:47:59,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:47:59,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:47:59,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:47:59,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:47:59,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:47:59,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:47:59,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:47:59,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:47:59,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:47:59,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:47:59,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:47:59,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:47:59,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:47:59,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:47:59,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:47:59,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:47:59,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:47:59,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:47:59,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:47:59,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:47:59,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:47:59,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:47:59,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:47:59,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:47:59,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:47:59,959 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:47:59,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:47:59,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:47:59,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:47:59,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:47:59,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:47:59,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:47:59,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:47:59,961 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:47:59,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:47:59,962 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:47:59,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:47:59,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:47:59,964 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:47:59,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:47:59,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:47:59,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:47:59,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:47:59,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:47:59,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:47:59,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:47:59,966 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:47:59,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:47:59,966 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:47:59,966 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 -> 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:48:00,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:48:00,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:48:00,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:48:00,242 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:48:00,242 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:48:00,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:01,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:48:01,472 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:48:01,473 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:01,482 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825808bb/7055e1aa6332409890f7730dadf5e9bd/FLAGab0921f53 [2023-09-01 09:48:01,495 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825808bb/7055e1aa6332409890f7730dadf5e9bd [2023-09-01 09:48:01,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:48:01,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:48:01,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:01,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:48:01,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:48:01,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:01,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b6306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01, skipping insertion in model container [2023-09-01 09:48:01,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:01,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:48:01,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:48:01,675 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:48:01,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:01,870 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:48:01,880 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/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2023-09-01 09:48:01,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:01,973 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:01,973 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:01,978 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:48:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01 WrapperNode [2023-09-01 09:48:01,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:01,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:01,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:48:01,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:48:01,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,046 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-09-01 09:48:02,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:02,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:48:02,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:48:02,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:48:02,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:48:02,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:48:02,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:48:02,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:48:02,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (1/1) ... [2023-09-01 09:48:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:48:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:48:02,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:48:02,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:48:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:48:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:48:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:48:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:48:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:48:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:48:02,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:48:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:48:02,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:48:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:48:02,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:48:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:48:02,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:48:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:48:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:48:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:48:02,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:48:02,175 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:48:02,313 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:48:02,315 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:48:02,532 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:48:02,648 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:48:02,649 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:48:02,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:02 BoogieIcfgContainer [2023-09-01 09:48:02,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:48:02,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:48:02,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:48:02,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:48:02,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:48:01" (1/3) ... [2023-09-01 09:48:02,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc52d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:02, skipping insertion in model container [2023-09-01 09:48:02,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:01" (2/3) ... [2023-09-01 09:48:02,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bc52d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:02, skipping insertion in model container [2023-09-01 09:48:02,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:02" (3/3) ... [2023-09-01 09:48:02,657 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2023-09-01 09:48:02,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:48:02,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:48:02,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:48:02,672 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:48:02,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:48:02,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-09-01 09:48:02,808 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-09-01 09:48:02,812 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:02,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:48:02,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-09-01 09:48:02,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-09-01 09:48:02,832 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:48:02,838 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-09-01 09:48:02,840 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-09-01 09:48:02,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-09-01 09:48:02,867 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-09-01 09:48:02,867 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:02,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:48:02,869 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-09-01 09:48:06,401 INFO L134 LiptonReduction]: Checked pairs total: 7449 [2023-09-01 09:48:06,402 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:48:06,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:48:06,415 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;@18d9d598, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:48:06,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:48:06,418 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-09-01 09:48:06,418 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:06,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:06,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:06,419 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-09-01 09:48:06,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 193420444, now seen corresponding path program 1 times [2023-09-01 09:48:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107926203] [2023-09-01 09:48:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:06,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107926203] [2023-09-01 09:48:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107926203] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544046741] [2023-09-01 09:48:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:06,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:06,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:06,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 238 [2023-09-01 09:48:06,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:06,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:06,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 238 [2023-09-01 09:48:06,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:07,133 INFO L130 PetriNetUnfolder]: 2855/4231 cut-off events. [2023-09-01 09:48:07,134 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-09-01 09:48:07,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8307 conditions, 4231 events. 2855/4231 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23151 event pairs, 545 based on Foata normal form. 0/4002 useless extension candidates. Maximal degree in co-relation 8295. Up to 3103 conditions per place. [2023-09-01 09:48:07,160 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-09-01 09:48:07,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-09-01 09:48:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-09-01 09:48:07,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5350140056022409 [2023-09-01 09:48:07,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-09-01 09:48:07,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-09-01 09:48:07,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:07,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-09-01 09:48:07,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:07,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:07,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:07,182 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 382 transitions. [2023-09-01 09:48:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-09-01 09:48:07,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:48:07,185 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-09-01 09:48:07,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-09-01 09:48:07,188 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-09-01 09:48:07,189 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-09-01 09:48:07,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:07,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:07,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:07,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:48:07,190 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-09-01 09:48:07,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash 212159424, now seen corresponding path program 1 times [2023-09-01 09:48:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566674069] [2023-09-01 09:48:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:07,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566674069] [2023-09-01 09:48:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566674069] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876196690] [2023-09-01 09:48:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:07,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:07,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:48:07,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:07,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:07,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:48:07,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:08,525 INFO L130 PetriNetUnfolder]: 9788/13469 cut-off events. [2023-09-01 09:48:08,526 INFO L131 PetriNetUnfolder]: For 598/598 co-relation queries the response was YES. [2023-09-01 09:48:08,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27860 conditions, 13469 events. 9788/13469 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 68449 event pairs, 3290 based on Foata normal form. 388/13857 useless extension candidates. Maximal degree in co-relation 27850. Up to 8281 conditions per place. [2023-09-01 09:48:08,602 INFO L137 encePairwiseOnDemand]: 229/238 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2023-09-01 09:48:08,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2023-09-01 09:48:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-09-01 09:48:08,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-09-01 09:48:08,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-09-01 09:48:08,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-09-01 09:48:08,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:08,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-09-01 09:48:08,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:08,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:08,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:08,673 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 360 transitions. [2023-09-01 09:48:08,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2023-09-01 09:48:08,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:08,676 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2023-09-01 09:48:08,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-09-01 09:48:08,677 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-09-01 09:48:08,677 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2023-09-01 09:48:08,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:08,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:08,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:08,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:48:08,678 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-09-01 09:48:08,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2012994747, now seen corresponding path program 1 times [2023-09-01 09:48:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:08,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113674217] [2023-09-01 09:48:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113674217] [2023-09-01 09:48:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113674217] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:48:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854099650] [2023-09-01 09:48:08,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:08,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:08,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:08,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:48:08,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:08,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:08,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:48:08,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:09,960 INFO L130 PetriNetUnfolder]: 9090/12519 cut-off events. [2023-09-01 09:48:09,960 INFO L131 PetriNetUnfolder]: For 6049/6049 co-relation queries the response was YES. [2023-09-01 09:48:09,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32340 conditions, 12519 events. 9090/12519 cut-off events. For 6049/6049 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 61547 event pairs, 2299 based on Foata normal form. 140/12659 useless extension candidates. Maximal degree in co-relation 32328. Up to 5489 conditions per place. [2023-09-01 09:48:09,996 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 51 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2023-09-01 09:48:09,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 316 flow [2023-09-01 09:48:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:48:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:48:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-09-01 09:48:09,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49369747899159666 [2023-09-01 09:48:09,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-09-01 09:48:09,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-09-01 09:48:09,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:09,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-09-01 09:48:10,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:10,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:10,002 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:10,002 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 470 transitions. [2023-09-01 09:48:10,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 316 flow [2023-09-01 09:48:10,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:10,019 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 164 flow [2023-09-01 09:48:10,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-09-01 09:48:10,020 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-09-01 09:48:10,020 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 164 flow [2023-09-01 09:48:10,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:10,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:10,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:10,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:48:10,021 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-09-01 09:48:10,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1961128255, now seen corresponding path program 1 times [2023-09-01 09:48:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958484728] [2023-09-01 09:48:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958484728] [2023-09-01 09:48:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958484728] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:10,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007611858] [2023-09-01 09:48:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:10,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:10,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:48:10,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:10,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:10,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:48:10,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:11,076 INFO L130 PetriNetUnfolder]: 7009/10219 cut-off events. [2023-09-01 09:48:11,076 INFO L131 PetriNetUnfolder]: For 7354/7473 co-relation queries the response was YES. [2023-09-01 09:48:11,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 10219 events. 7009/10219 cut-off events. For 7354/7473 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 57942 event pairs, 2267 based on Foata normal form. 107/10151 useless extension candidates. Maximal degree in co-relation 27096. Up to 8776 conditions per place. [2023-09-01 09:48:11,117 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2023-09-01 09:48:11,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 340 flow [2023-09-01 09:48:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-09-01 09:48:11,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280112044817927 [2023-09-01 09:48:11,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-09-01 09:48:11,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-09-01 09:48:11,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:11,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-09-01 09:48:11,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:11,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:11,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:11,125 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 164 flow. Second operand 3 states and 377 transitions. [2023-09-01 09:48:11,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 340 flow [2023-09-01 09:48:11,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:11,150 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 232 flow [2023-09-01 09:48:11,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-09-01 09:48:11,151 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-09-01 09:48:11,151 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 232 flow [2023-09-01 09:48:11,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:11,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:11,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:11,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:48:11,152 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-09-01 09:48:11,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1752740964, now seen corresponding path program 1 times [2023-09-01 09:48:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876855283] [2023-09-01 09:48:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876855283] [2023-09-01 09:48:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876855283] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774259494] [2023-09-01 09:48:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:11,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:11,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:48:11,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:11,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:11,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:48:11,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:12,062 INFO L130 PetriNetUnfolder]: 5922/8781 cut-off events. [2023-09-01 09:48:12,063 INFO L131 PetriNetUnfolder]: For 9045/9593 co-relation queries the response was YES. [2023-09-01 09:48:12,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23642 conditions, 8781 events. 5922/8781 cut-off events. For 9045/9593 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 52820 event pairs, 1029 based on Foata normal form. 784/9217 useless extension candidates. Maximal degree in co-relation 23625. Up to 5590 conditions per place. [2023-09-01 09:48:12,098 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 84 selfloop transitions, 10 changer transitions 0/107 dead transitions. [2023-09-01 09:48:12,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 107 transitions, 719 flow [2023-09-01 09:48:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:48:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:48:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-09-01 09:48:12,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2023-09-01 09:48:12,101 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-09-01 09:48:12,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-09-01 09:48:12,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:12,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-09-01 09:48:12,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,104 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 232 flow. Second operand 5 states and 609 transitions. [2023-09-01 09:48:12,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 107 transitions, 719 flow [2023-09-01 09:48:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 107 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:12,114 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 300 flow [2023-09-01 09:48:12,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-09-01 09:48:12,114 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-09-01 09:48:12,114 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 300 flow [2023-09-01 09:48:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:12,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:48:12,115 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-09-01 09:48:12,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 368276496, now seen corresponding path program 1 times [2023-09-01 09:48:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449979257] [2023-09-01 09:48:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449979257] [2023-09-01 09:48:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449979257] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:48:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656326554] [2023-09-01 09:48:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:12,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:48:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:48:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:48:12,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:48:12,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:12,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:48:12,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:12,904 INFO L130 PetriNetUnfolder]: 4760/7303 cut-off events. [2023-09-01 09:48:12,904 INFO L131 PetriNetUnfolder]: For 10277/10883 co-relation queries the response was YES. [2023-09-01 09:48:12,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24540 conditions, 7303 events. 4760/7303 cut-off events. For 10277/10883 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 45378 event pairs, 434 based on Foata normal form. 689/7755 useless extension candidates. Maximal degree in co-relation 24519. Up to 2411 conditions per place. [2023-09-01 09:48:12,934 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 112 selfloop transitions, 19 changer transitions 4/148 dead transitions. [2023-09-01 09:48:12,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 148 transitions, 1070 flow [2023-09-01 09:48:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:48:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:48:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-09-01 09:48:12,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-09-01 09:48:12,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-09-01 09:48:12,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-09-01 09:48:12,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:12,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-09-01 09:48:12,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,941 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,941 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 300 flow. Second operand 7 states and 854 transitions. [2023-09-01 09:48:12,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 148 transitions, 1070 flow [2023-09-01 09:48:12,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 148 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:12,960 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 429 flow [2023-09-01 09:48:12,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-09-01 09:48:12,961 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-09-01 09:48:12,961 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 429 flow [2023-09-01 09:48:12,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:12,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:12,962 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-09-01 09:48:12,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:48:12,962 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-09-01 09:48:12,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1414717743, now seen corresponding path program 1 times [2023-09-01 09:48:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284961663] [2023-09-01 09:48:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284961663] [2023-09-01 09:48:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284961663] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:48:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698152241] [2023-09-01 09:48:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:13,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:48:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:48:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:48:13,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:48:13,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:13,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:13,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:48:13,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:14,212 INFO L130 PetriNetUnfolder]: 4362/6702 cut-off events. [2023-09-01 09:48:14,212 INFO L131 PetriNetUnfolder]: For 15634/16429 co-relation queries the response was YES. [2023-09-01 09:48:14,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26200 conditions, 6702 events. 4362/6702 cut-off events. For 15634/16429 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 41323 event pairs, 339 based on Foata normal form. 466/6957 useless extension candidates. Maximal degree in co-relation 26175. Up to 2275 conditions per place. [2023-09-01 09:48:14,247 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 122 selfloop transitions, 28 changer transitions 16/179 dead transitions. [2023-09-01 09:48:14,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 179 transitions, 1405 flow [2023-09-01 09:48:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:48:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:48:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2023-09-01 09:48:14,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121381886087768 [2023-09-01 09:48:14,250 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2023-09-01 09:48:14,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2023-09-01 09:48:14,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:14,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2023-09-01 09:48:14,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:14,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:14,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:14,261 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 429 flow. Second operand 9 states and 1097 transitions. [2023-09-01 09:48:14,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 179 transitions, 1405 flow [2023-09-01 09:48:14,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 179 transitions, 1355 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:48:14,646 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 557 flow [2023-09-01 09:48:14,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=557, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-09-01 09:48:14,647 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-09-01 09:48:14,647 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 557 flow [2023-09-01 09:48:14,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:14,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:14,648 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-09-01 09:48:14,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:48:14,648 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-09-01 09:48:14,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1667587089, now seen corresponding path program 1 times [2023-09-01 09:48:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496597068] [2023-09-01 09:48:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496597068] [2023-09-01 09:48:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496597068] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420079728] [2023-09-01 09:48:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:14,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:14,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:14,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:14,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-09-01 09:48:14,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:14,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:14,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-09-01 09:48:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:15,835 INFO L130 PetriNetUnfolder]: 6979/10288 cut-off events. [2023-09-01 09:48:15,835 INFO L131 PetriNetUnfolder]: For 34536/34536 co-relation queries the response was YES. [2023-09-01 09:48:15,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43135 conditions, 10288 events. 6979/10288 cut-off events. For 34536/34536 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 58654 event pairs, 747 based on Foata normal form. 12/10300 useless extension candidates. Maximal degree in co-relation 43107. Up to 4865 conditions per place. [2023-09-01 09:48:15,885 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 105 selfloop transitions, 30 changer transitions 60/195 dead transitions. [2023-09-01 09:48:15,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 195 transitions, 1957 flow [2023-09-01 09:48:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:48:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:48:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-09-01 09:48:15,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016806722689076 [2023-09-01 09:48:15,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-09-01 09:48:15,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-09-01 09:48:15,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:15,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-09-01 09:48:15,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:15,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:15,891 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:15,891 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 557 flow. Second operand 5 states and 597 transitions. [2023-09-01 09:48:15,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 195 transitions, 1957 flow [2023-09-01 09:48:16,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 195 transitions, 1616 flow, removed 120 selfloop flow, removed 4 redundant places. [2023-09-01 09:48:16,409 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 596 flow [2023-09-01 09:48:16,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=596, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-09-01 09:48:16,410 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-09-01 09:48:16,410 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 596 flow [2023-09-01 09:48:16,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:16,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:16,410 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-09-01 09:48:16,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:48:16,411 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-09-01 09:48:16,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1889957505, now seen corresponding path program 2 times [2023-09-01 09:48:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:16,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986481857] [2023-09-01 09:48:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986481857] [2023-09-01 09:48:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986481857] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:48:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54982117] [2023-09-01 09:48:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:48:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:48:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:48:16,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-09-01 09:48:16,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:16,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:16,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-09-01 09:48:16,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:17,218 INFO L130 PetriNetUnfolder]: 3336/5086 cut-off events. [2023-09-01 09:48:17,218 INFO L131 PetriNetUnfolder]: For 15538/15538 co-relation queries the response was YES. [2023-09-01 09:48:17,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21688 conditions, 5086 events. 3336/5086 cut-off events. For 15538/15538 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 26659 event pairs, 334 based on Foata normal form. 11/5097 useless extension candidates. Maximal degree in co-relation 21656. Up to 1587 conditions per place. [2023-09-01 09:48:17,233 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 102 selfloop transitions, 27 changer transitions 42/171 dead transitions. [2023-09-01 09:48:17,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 171 transitions, 1553 flow [2023-09-01 09:48:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:48:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:48:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-09-01 09:48:17,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49859943977591037 [2023-09-01 09:48:17,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-09-01 09:48:17,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-09-01 09:48:17,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:17,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-09-01 09:48:17,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,239 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,239 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 596 flow. Second operand 6 states and 712 transitions. [2023-09-01 09:48:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 171 transitions, 1553 flow [2023-09-01 09:48:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 1479 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-09-01 09:48:17,282 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 563 flow [2023-09-01 09:48:17,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2023-09-01 09:48:17,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-09-01 09:48:17,282 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 563 flow [2023-09-01 09:48:17,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:17,283 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-09-01 09:48:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:48:17,283 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-09-01 09:48:17,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 407695787, now seen corresponding path program 3 times [2023-09-01 09:48:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950560764] [2023-09-01 09:48:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950560764] [2023-09-01 09:48:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950560764] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:48:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021297571] [2023-09-01 09:48:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:17,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:48:17,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 563 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:17,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:48:17,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:17,804 INFO L130 PetriNetUnfolder]: 3224/5126 cut-off events. [2023-09-01 09:48:17,804 INFO L131 PetriNetUnfolder]: For 16796/16796 co-relation queries the response was YES. [2023-09-01 09:48:17,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21849 conditions, 5126 events. 3224/5126 cut-off events. For 16796/16796 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 28798 event pairs, 538 based on Foata normal form. 10/5136 useless extension candidates. Maximal degree in co-relation 21819. Up to 2233 conditions per place. [2023-09-01 09:48:17,819 INFO L137 encePairwiseOnDemand]: 229/238 looper letters, 87 selfloop transitions, 24 changer transitions 17/128 dead transitions. [2023-09-01 09:48:17,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 1208 flow [2023-09-01 09:48:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:48:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:48:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-09-01 09:48:17,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509453781512605 [2023-09-01 09:48:17,821 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-09-01 09:48:17,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-09-01 09:48:17,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:17,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-09-01 09:48:17,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,823 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,823 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 563 flow. Second operand 4 states and 485 transitions. [2023-09-01 09:48:17,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 1208 flow [2023-09-01 09:48:17,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 128 transitions, 1125 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-09-01 09:48:17,882 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 612 flow [2023-09-01 09:48:17,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=612, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-09-01 09:48:17,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-09-01 09:48:17,884 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 612 flow [2023-09-01 09:48:17,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:17,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:17,885 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-09-01 09:48:17,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:48:17,885 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-09-01 09:48:17,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1183438763, now seen corresponding path program 4 times [2023-09-01 09:48:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:17,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902028968] [2023-09-01 09:48:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902028968] [2023-09-01 09:48:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902028968] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:48:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141420675] [2023-09-01 09:48:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:18,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:48:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:48:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:48:18,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:48:18,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:18,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:48:18,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:18,384 INFO L130 PetriNetUnfolder]: 1785/2994 cut-off events. [2023-09-01 09:48:18,384 INFO L131 PetriNetUnfolder]: For 10831/10969 co-relation queries the response was YES. [2023-09-01 09:48:18,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12058 conditions, 2994 events. 1785/2994 cut-off events. For 10831/10969 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17537 event pairs, 287 based on Foata normal form. 117/3060 useless extension candidates. Maximal degree in co-relation 12027. Up to 1139 conditions per place. [2023-09-01 09:48:18,392 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 43 selfloop transitions, 17 changer transitions 73/143 dead transitions. [2023-09-01 09:48:18,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1496 flow [2023-09-01 09:48:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:48:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:48:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-09-01 09:48:18,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005252100840336 [2023-09-01 09:48:18,394 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-09-01 09:48:18,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-09-01 09:48:18,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:18,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-09-01 09:48:18,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,398 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,398 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 612 flow. Second operand 8 states and 953 transitions. [2023-09-01 09:48:18,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1496 flow [2023-09-01 09:48:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 143 transitions, 1449 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:18,441 INFO L231 Difference]: Finished difference. Result has 74 places, 46 transitions, 383 flow [2023-09-01 09:48:18,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=383, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2023-09-01 09:48:18,441 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-09-01 09:48:18,441 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 383 flow [2023-09-01 09:48:18,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:18,442 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-09-01 09:48:18,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:48:18,442 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-09-01 09:48:18,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 623654159, now seen corresponding path program 1 times [2023-09-01 09:48:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431138076] [2023-09-01 09:48:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:18,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:18,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431138076] [2023-09-01 09:48:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431138076] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:18,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:48:18,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620356864] [2023-09-01 09:48:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:18,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:18,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:18,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:48:18,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:18,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:48:18,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:18,756 INFO L130 PetriNetUnfolder]: 619/1103 cut-off events. [2023-09-01 09:48:18,757 INFO L131 PetriNetUnfolder]: For 5024/5034 co-relation queries the response was YES. [2023-09-01 09:48:18,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1103 events. 619/1103 cut-off events. For 5024/5034 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5376 event pairs, 244 based on Foata normal form. 1/1097 useless extension candidates. Maximal degree in co-relation 4965. Up to 585 conditions per place. [2023-09-01 09:48:18,760 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 37 selfloop transitions, 2 changer transitions 31/73 dead transitions. [2023-09-01 09:48:18,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 727 flow [2023-09-01 09:48:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-09-01 09:48:18,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-09-01 09:48:18,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-09-01 09:48:18,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-09-01 09:48:18,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:18,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-09-01 09:48:18,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,764 INFO L175 Difference]: Start difference. First operand has 74 places, 46 transitions, 383 flow. Second operand 3 states and 374 transitions. [2023-09-01 09:48:18,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 727 flow [2023-09-01 09:48:18,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 542 flow, removed 34 selfloop flow, removed 16 redundant places. [2023-09-01 09:48:18,771 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 205 flow [2023-09-01 09:48:18,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-09-01 09:48:18,773 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-09-01 09:48:18,773 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 205 flow [2023-09-01 09:48:18,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:18,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:18,774 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-09-01 09:48:18,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:48:18,774 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-09-01 09:48:18,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -311643595, now seen corresponding path program 2 times [2023-09-01 09:48:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:18,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985882154] [2023-09-01 09:48:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:19,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985882154] [2023-09-01 09:48:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985882154] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:19,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:19,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:48:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099081137] [2023-09-01 09:48:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:19,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:48:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:48:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:48:19,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:48:19,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:19,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:19,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:48:19,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:19,479 INFO L130 PetriNetUnfolder]: 192/358 cut-off events. [2023-09-01 09:48:19,479 INFO L131 PetriNetUnfolder]: For 825/829 co-relation queries the response was YES. [2023-09-01 09:48:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 358 events. 192/358 cut-off events. For 825/829 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1418 event pairs, 19 based on Foata normal form. 2/357 useless extension candidates. Maximal degree in co-relation 1247. Up to 191 conditions per place. [2023-09-01 09:48:19,480 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 42 selfloop transitions, 4 changer transitions 25/75 dead transitions. [2023-09-01 09:48:19,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 547 flow [2023-09-01 09:48:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:48:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:48:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2023-09-01 09:48:19,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831932773109244 [2023-09-01 09:48:19,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2023-09-01 09:48:19,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2023-09-01 09:48:19,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:19,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2023-09-01 09:48:19,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:19,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:19,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:19,486 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 205 flow. Second operand 7 states and 805 transitions. [2023-09-01 09:48:19,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 547 flow [2023-09-01 09:48:19,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 498 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-09-01 09:48:19,489 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 184 flow [2023-09-01 09:48:19,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-09-01 09:48:19,490 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-09-01 09:48:19,490 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 184 flow [2023-09-01 09:48:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:19,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:19,490 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-09-01 09:48:19,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:48:19,490 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-09-01 09:48:19,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1222016941, now seen corresponding path program 3 times [2023-09-01 09:48:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143212799] [2023-09-01 09:48:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:48:19,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:48:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:48:19,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:48:19,610 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:48:19,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:48:19,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:48:19,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:48:19,613 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:19,617 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:48:19,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:48:19,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:48:19 BasicIcfg [2023-09-01 09:48:19,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:48:19,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:48:19,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:48:19,685 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:48:19,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:02" (3/4) ... [2023-09-01 09:48:19,686 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:48:19,753 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:48:19,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:48:19,754 INFO L158 Benchmark]: Toolchain (without parser) took 18256.28ms. Allocated memory was 96.5MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 72.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-09-01 09:48:19,754 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:48:19,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.44ms. Allocated memory is still 96.5MB. Free memory was 72.4MB in the beginning and 72.9MB in the end (delta: -462.0kB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-09-01 09:48:19,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.12ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 70.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:48:19,755 INFO L158 Benchmark]: Boogie Preprocessor took 18.65ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:48:19,755 INFO L158 Benchmark]: RCFGBuilder took 584.69ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 69.7MB in the end (delta: -979.7kB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2023-09-01 09:48:19,755 INFO L158 Benchmark]: TraceAbstraction took 17032.36ms. Allocated memory was 96.5MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 68.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-09-01 09:48:19,756 INFO L158 Benchmark]: Witness Printer took 68.96ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-09-01 09:48:19,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.44ms. Allocated memory is still 96.5MB. Free memory was 72.4MB in the beginning and 72.9MB in the end (delta: -462.0kB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.12ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 70.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.65ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 584.69ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 69.7MB in the end (delta: -979.7kB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17032.36ms. Allocated memory was 96.5MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 68.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 68.96ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 135 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7449 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3805, independent: 3592, independent conditional: 0, independent unconditional: 3592, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1562, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3805, independent: 2074, independent conditional: 0, independent unconditional: 2074, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 1562, unknown conditional: 0, unknown unconditional: 1562] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-1, t717={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] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=0, t717={5:0}, t718={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] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=1, t717={5:0}, t718={6:0}, t719={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] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=2, t717={5:0}, t718={6:0}, t719={7:0}, t720={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] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, 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] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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}, 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] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2] [L832] 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) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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=2] [L809] 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) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 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 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice2=1, x=2, 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=2] [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$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=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 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: 16.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 102 mSDtfsCounter, 1392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=612occurred in iteration=10, InterpolantAutomatonStates: 67, 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.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1283 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-09-01 09:48:19,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE