./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_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 e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:55:34,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:55:34,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:55:34,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:55:34,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:55:34,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:55:34,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:55:34,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:55:34,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:55:34,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:55:34,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:55:34,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:55:34,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:55:34,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:55:34,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:55:34,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:55:34,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:55:34,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:55:34,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:55:34,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:55:34,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:55:34,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:55:34,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:55:34,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:55:34,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:55:34,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:55:34,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:55:34,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:55:34,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:55:34,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:55:34,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:55:34,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:55:34,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:55:34,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:55:34,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:55:34,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:55:34,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:55:34,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:55:34,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:55:34,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:55:34,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:55:34,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:55:34,955 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:55:34,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:55:34,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:55:34,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:55:34,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:55:34,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:55:34,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:55:34,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:55:34,959 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:55:34,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:55:34,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:55:34,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:55:34,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:55:34,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:55:34,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:55:34,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:55:34,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:55:34,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:55:34,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:55:34,963 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:55:34,964 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 -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:55:35,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:55:35,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:55:35,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:55:35,237 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:55:35,237 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:55:35,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:36,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:55:36,476 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:55:36,477 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:36,496 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa78fc91/913e3dd85ccc4764a7bc8496931648e4/FLAG925c70094 [2023-08-30 16:55:36,525 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa78fc91/913e3dd85ccc4764a7bc8496931648e4 [2023-08-30 16:55:36,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:55:36,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:55:36,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:55:36,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:55:36,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:55:36,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:36,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af63f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36, skipping insertion in model container [2023-08-30 16:55:36,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:36,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:55:36,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:55:36,721 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-30 16:55:36,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:55:36,899 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:55:36,908 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/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2023-08-30 16:55:36,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:55:36,985 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:55:36,985 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:55:36,990 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:55:36,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36 WrapperNode [2023-08-30 16:55:36,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:55:36,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:55:36,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:55:36,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:55:36,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,047 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:55:37,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:55:37,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:55:37,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:55:37,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:55:37,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,069 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:55:37,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:55:37,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:55:37,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:55:37,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (1/1) ... [2023-08-30 16:55:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:55:37,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:55:37,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:55:37,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:55:37,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:55:37,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:55:37,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:55:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:55:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:55:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:55:37,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:55:37,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:55:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:55:37,196 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:55:37,282 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:55:37,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:55:37,568 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:55:37,664 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:55:37,664 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:55:37,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:37 BoogieIcfgContainer [2023-08-30 16:55:37,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:55:37,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:55:37,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:55:37,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:55:37,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:55:36" (1/3) ... [2023-08-30 16:55:37,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f0e648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:55:37, skipping insertion in model container [2023-08-30 16:55:37,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:55:36" (2/3) ... [2023-08-30 16:55:37,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f0e648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:55:37, skipping insertion in model container [2023-08-30 16:55:37,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:37" (3/3) ... [2023-08-30 16:55:37,672 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-30 16:55:37,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:55:37,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:55:37,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:55:37,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:55:37,733 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:55:37,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:55:37,804 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:55:37,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:55:37,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:55:37,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-30 16:55:37,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-30 16:55:37,816 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:55:37,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:55:37,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-30 16:55:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-30 16:55:37,841 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-08-30 16:55:37,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:55:37,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 16:55:37,843 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-08-30 16:55:41,091 INFO L134 LiptonReduction]: Checked pairs total: 5105 [2023-08-30 16:55:41,092 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-30 16:55:41,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:55:41,117 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;@4fcb2be5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:55:41,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:55:41,119 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:55:41,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:55:41,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:41,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:55:41,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:41,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash 472636, now seen corresponding path program 1 times [2023-08-30 16:55:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888890630] [2023-08-30 16:55:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888890630] [2023-08-30 16:55:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888890630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:55:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598609445] [2023-08-30 16:55:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:41,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:55:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:55:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:55:41,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-08-30 16:55:41,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:41,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:41,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-08-30 16:55:41,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:41,706 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2023-08-30 16:55:41,706 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-30 16:55:41,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6094 event pairs, 111 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 871 conditions per place. [2023-08-30 16:55:41,712 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-30 16:55:41,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-08-30 16:55:41,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:55:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:55:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-30 16:55:41,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188834154351396 [2023-08-30 16:55:41,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-30 16:55:41,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-30 16:55:41,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:41,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-30 16:55:41,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:41,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:41,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:41,732 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-08-30 16:55:41,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-08-30 16:55:41,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:55:41,735 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-30 16:55:41,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:55:41,738 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:55:41,738 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-30 16:55:41,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:41,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:41,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:41,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:55:41,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:41,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1330620814, now seen corresponding path program 1 times [2023-08-30 16:55:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:41,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074722480] [2023-08-30 16:55:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074722480] [2023-08-30 16:55:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074722480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:42,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:42,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:55:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485298805] [2023-08-30 16:55:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:55:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:55:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:55:42,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-08-30 16:55:42,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:42,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-08-30 16:55:42,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:42,413 INFO L130 PetriNetUnfolder]: 527/861 cut-off events. [2023-08-30 16:55:42,414 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-30 16:55:42,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 861 events. 527/861 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3928 event pairs, 143 based on Foata normal form. 16/873 useless extension candidates. Maximal degree in co-relation 1775. Up to 609 conditions per place. [2023-08-30 16:55:42,420 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-30 16:55:42,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2023-08-30 16:55:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:55:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:55:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-30 16:55:42,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729064039408867 [2023-08-30 16:55:42,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-30 16:55:42,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-30 16:55:42,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:42,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-30 16:55:42,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,432 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 288 transitions. [2023-08-30 16:55:42,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2023-08-30 16:55:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:42,433 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-08-30 16:55:42,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 16:55:42,434 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 16:55:42,434 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-08-30 16:55:42,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:42,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:42,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:55:42,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:42,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1700426340, now seen corresponding path program 1 times [2023-08-30 16:55:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:42,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051549349] [2023-08-30 16:55:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051549349] [2023-08-30 16:55:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051549349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:42,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:55:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561244026] [2023-08-30 16:55:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:42,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:55:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:42,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:55:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:55:42,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 203 [2023-08-30 16:55:42,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:42,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 203 [2023-08-30 16:55:42,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:42,949 INFO L130 PetriNetUnfolder]: 498/829 cut-off events. [2023-08-30 16:55:42,950 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-30 16:55:42,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 829 events. 498/829 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3945 event pairs, 93 based on Foata normal form. 12/836 useless extension candidates. Maximal degree in co-relation 1764. Up to 634 conditions per place. [2023-08-30 16:55:42,953 INFO L137 encePairwiseOnDemand]: 200/203 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-30 16:55:42,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 137 flow [2023-08-30 16:55:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:55:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:55:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-08-30 16:55:42,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-08-30 16:55:42,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-08-30 16:55:42,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-08-30 16:55:42,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:42,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-08-30 16:55:42,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,957 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 290 transitions. [2023-08-30 16:55:42,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 137 flow [2023-08-30 16:55:42,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:42,958 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2023-08-30 16:55:42,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-30 16:55:42,959 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-30 16:55:42,959 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2023-08-30 16:55:42,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:42,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:42,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:42,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:55:42,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:42,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1151437425, now seen corresponding path program 1 times [2023-08-30 16:55:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:42,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577082176] [2023-08-30 16:55:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577082176] [2023-08-30 16:55:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577082176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:55:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001399998] [2023-08-30 16:55:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:55:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:55:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:55:43,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 203 [2023-08-30 16:55:43,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:43,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 203 [2023-08-30 16:55:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:43,421 INFO L130 PetriNetUnfolder]: 623/984 cut-off events. [2023-08-30 16:55:43,421 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2023-08-30 16:55:43,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 984 events. 623/984 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4461 event pairs, 158 based on Foata normal form. 3/986 useless extension candidates. Maximal degree in co-relation 2243. Up to 886 conditions per place. [2023-08-30 16:55:43,425 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 28 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-30 16:55:43,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 154 flow [2023-08-30 16:55:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:55:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:55:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-30 16:55:43,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106732348111659 [2023-08-30 16:55:43,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-30 16:55:43,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-30 16:55:43,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:43,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-30 16:55:43,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,429 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 3 states and 311 transitions. [2023-08-30 16:55:43,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 154 flow [2023-08-30 16:55:43,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:43,430 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2023-08-30 16:55:43,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-08-30 16:55:43,431 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-08-30 16:55:43,431 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2023-08-30 16:55:43,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:43,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:43,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:55:43,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:43,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1560278402, now seen corresponding path program 1 times [2023-08-30 16:55:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718182593] [2023-08-30 16:55:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718182593] [2023-08-30 16:55:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718182593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626957046] [2023-08-30 16:55:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:43,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:43,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 203 [2023-08-30 16:55:43,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:43,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 203 [2023-08-30 16:55:43,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:43,955 INFO L130 PetriNetUnfolder]: 944/1507 cut-off events. [2023-08-30 16:55:43,956 INFO L131 PetriNetUnfolder]: For 654/654 co-relation queries the response was YES. [2023-08-30 16:55:43,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3448 conditions, 1507 events. 944/1507 cut-off events. For 654/654 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7772 event pairs, 197 based on Foata normal form. 57/1541 useless extension candidates. Maximal degree in co-relation 3435. Up to 573 conditions per place. [2023-08-30 16:55:43,962 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 35 selfloop transitions, 3 changer transitions 5/46 dead transitions. [2023-08-30 16:55:43,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 216 flow [2023-08-30 16:55:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:55:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:55:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-08-30 16:55:43,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729064039408867 [2023-08-30 16:55:43,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-08-30 16:55:43,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-08-30 16:55:43,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:43,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-08-30 16:55:43,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,967 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,967 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 4 states and 384 transitions. [2023-08-30 16:55:43,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 216 flow [2023-08-30 16:55:43,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:55:43,968 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 86 flow [2023-08-30 16:55:43,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-08-30 16:55:43,970 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2023-08-30 16:55:43,970 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 86 flow [2023-08-30 16:55:43,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:43,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:43,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:43,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:55:43,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:43,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1385265302, now seen corresponding path program 1 times [2023-08-30 16:55:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6983567] [2023-08-30 16:55:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:44,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:44,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6983567] [2023-08-30 16:55:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6983567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:44,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612725795] [2023-08-30 16:55:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:44,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:44,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:44,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 203 [2023-08-30 16:55:44,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:44,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:44,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 203 [2023-08-30 16:55:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:44,469 INFO L130 PetriNetUnfolder]: 681/1099 cut-off events. [2023-08-30 16:55:44,469 INFO L131 PetriNetUnfolder]: For 1401/1402 co-relation queries the response was YES. [2023-08-30 16:55:44,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 1099 events. 681/1099 cut-off events. For 1401/1402 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4891 event pairs, 185 based on Foata normal form. 48/1138 useless extension candidates. Maximal degree in co-relation 2629. Up to 411 conditions per place. [2023-08-30 16:55:44,473 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 28 selfloop transitions, 3 changer transitions 7/40 dead transitions. [2023-08-30 16:55:44,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 197 flow [2023-08-30 16:55:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:55:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:55:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-30 16:55:44,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033 [2023-08-30 16:55:44,475 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-30 16:55:44,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-30 16:55:44,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:44,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-30 16:55:44,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:44,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:44,478 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:44,478 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 86 flow. Second operand 4 states and 378 transitions. [2023-08-30 16:55:44,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 197 flow [2023-08-30 16:55:44,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 185 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:55:44,481 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 80 flow [2023-08-30 16:55:44,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-08-30 16:55:44,482 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2023-08-30 16:55:44,482 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 80 flow [2023-08-30 16:55:44,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:44,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:44,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:55:44,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:44,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 562797259, now seen corresponding path program 1 times [2023-08-30 16:55:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422659380] [2023-08-30 16:55:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:45,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422659380] [2023-08-30 16:55:45,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422659380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:45,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:55:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181285225] [2023-08-30 16:55:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:45,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:55:45,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:55:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:55:45,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 203 [2023-08-30 16:55:45,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:45,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 203 [2023-08-30 16:55:45,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:45,442 INFO L130 PetriNetUnfolder]: 369/597 cut-off events. [2023-08-30 16:55:45,443 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2023-08-30 16:55:45,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 597 events. 369/597 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2084 event pairs, 163 based on Foata normal form. 2/599 useless extension candidates. Maximal degree in co-relation 1537. Up to 546 conditions per place. [2023-08-30 16:55:45,446 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 32 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-08-30 16:55:45,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 206 flow [2023-08-30 16:55:45,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:55:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:55:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-30 16:55:45,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605911330049261 [2023-08-30 16:55:45,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-30 16:55:45,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-30 16:55:45,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:45,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-30 16:55:45,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 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-08-30 16:55:45,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,450 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 80 flow. Second operand 4 states and 374 transitions. [2023-08-30 16:55:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 206 flow [2023-08-30 16:55:45,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 185 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 16:55:45,452 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 90 flow [2023-08-30 16:55:45,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-30 16:55:45,453 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-30 16:55:45,453 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 90 flow [2023-08-30 16:55:45,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:45,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:45,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:55:45,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:45,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash 909334148, now seen corresponding path program 1 times [2023-08-30 16:55:45,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:45,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646889899] [2023-08-30 16:55:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646889899] [2023-08-30 16:55:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646889899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:55:45,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524109052] [2023-08-30 16:55:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:45,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:55:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:55:45,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:55:45,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-08-30 16:55:45,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:45,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-08-30 16:55:45,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:45,766 INFO L130 PetriNetUnfolder]: 255/458 cut-off events. [2023-08-30 16:55:45,766 INFO L131 PetriNetUnfolder]: For 240/244 co-relation queries the response was YES. [2023-08-30 16:55:45,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 458 events. 255/458 cut-off events. For 240/244 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1890 event pairs, 49 based on Foata normal form. 41/489 useless extension candidates. Maximal degree in co-relation 1211. Up to 185 conditions per place. [2023-08-30 16:55:45,768 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 36 selfloop transitions, 5 changer transitions 1/45 dead transitions. [2023-08-30 16:55:45,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 238 flow [2023-08-30 16:55:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:55:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:55:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2023-08-30 16:55:45,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48891625615763545 [2023-08-30 16:55:45,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2023-08-30 16:55:45,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2023-08-30 16:55:45,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:45,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2023-08-30 16:55:45,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,773 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 90 flow. Second operand 4 states and 397 transitions. [2023-08-30 16:55:45,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 238 flow [2023-08-30 16:55:45,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:45,774 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 118 flow [2023-08-30 16:55:45,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:55:45,775 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-30 16:55:45,775 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 118 flow [2023-08-30 16:55:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:45,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:45,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:55:45,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:45,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash -639165580, now seen corresponding path program 1 times [2023-08-30 16:55:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827429463] [2023-08-30 16:55:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827429463] [2023-08-30 16:55:45,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827429463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:55:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711466657] [2023-08-30 16:55:45,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:45,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:55:45,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:45,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:55:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:55:45,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-08-30 16:55:45,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:45,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:45,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-08-30 16:55:45,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:46,111 INFO L130 PetriNetUnfolder]: 137/271 cut-off events. [2023-08-30 16:55:46,112 INFO L131 PetriNetUnfolder]: For 222/226 co-relation queries the response was YES. [2023-08-30 16:55:46,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 271 events. 137/271 cut-off events. For 222/226 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 959 event pairs, 24 based on Foata normal form. 26/292 useless extension candidates. Maximal degree in co-relation 869. Up to 102 conditions per place. [2023-08-30 16:55:46,114 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 41 selfloop transitions, 8 changer transitions 1/53 dead transitions. [2023-08-30 16:55:46,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 316 flow [2023-08-30 16:55:46,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:55:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:55:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2023-08-30 16:55:46,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48669950738916257 [2023-08-30 16:55:46,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2023-08-30 16:55:46,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2023-08-30 16:55:46,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:46,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2023-08-30 16:55:46,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,119 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 118 flow. Second operand 5 states and 494 transitions. [2023-08-30 16:55:46,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 316 flow [2023-08-30 16:55:46,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:46,122 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 158 flow [2023-08-30 16:55:46,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 16:55:46,123 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-30 16:55:46,123 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 158 flow [2023-08-30 16:55:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:46,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:46,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:55:46,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:46,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2068607719, now seen corresponding path program 1 times [2023-08-30 16:55:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607634842] [2023-08-30 16:55:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607634842] [2023-08-30 16:55:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607634842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:46,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:55:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961560948] [2023-08-30 16:55:46,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:46,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:55:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:55:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:55:46,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-08-30 16:55:46,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:46,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-08-30 16:55:46,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:46,500 INFO L130 PetriNetUnfolder]: 90/186 cut-off events. [2023-08-30 16:55:46,501 INFO L131 PetriNetUnfolder]: For 290/294 co-relation queries the response was YES. [2023-08-30 16:55:46,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 186 events. 90/186 cut-off events. For 290/294 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 566 event pairs, 24 based on Foata normal form. 9/192 useless extension candidates. Maximal degree in co-relation 650. Up to 66 conditions per place. [2023-08-30 16:55:46,502 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 31 selfloop transitions, 11 changer transitions 1/46 dead transitions. [2023-08-30 16:55:46,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 303 flow [2023-08-30 16:55:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 576 transitions. [2023-08-30 16:55:46,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729064039408867 [2023-08-30 16:55:46,504 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 576 transitions. [2023-08-30 16:55:46,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 576 transitions. [2023-08-30 16:55:46,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:46,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 576 transitions. [2023-08-30 16:55:46,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,508 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,508 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 158 flow. Second operand 6 states and 576 transitions. [2023-08-30 16:55:46,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 303 flow [2023-08-30 16:55:46,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 264 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-08-30 16:55:46,510 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 160 flow [2023-08-30 16:55:46,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-30 16:55:46,511 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-30 16:55:46,512 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 160 flow [2023-08-30 16:55:46,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:46,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:46,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:46,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:55:46,513 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:46,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1318740538, now seen corresponding path program 1 times [2023-08-30 16:55:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:46,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956502850] [2023-08-30 16:55:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956502850] [2023-08-30 16:55:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956502850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:47,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:55:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139460309] [2023-08-30 16:55:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:47,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:55:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:55:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:55:47,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 203 [2023-08-30 16:55:47,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:47,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:47,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 203 [2023-08-30 16:55:47,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:47,232 INFO L130 PetriNetUnfolder]: 118/239 cut-off events. [2023-08-30 16:55:47,232 INFO L131 PetriNetUnfolder]: For 390/396 co-relation queries the response was YES. [2023-08-30 16:55:47,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 239 events. 118/239 cut-off events. For 390/396 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 769 event pairs, 14 based on Foata normal form. 7/246 useless extension candidates. Maximal degree in co-relation 853. Up to 163 conditions per place. [2023-08-30 16:55:47,233 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 40 selfloop transitions, 14 changer transitions 7/63 dead transitions. [2023-08-30 16:55:47,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 468 flow [2023-08-30 16:55:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 577 transitions. [2023-08-30 16:55:47,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47372742200328405 [2023-08-30 16:55:47,236 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 577 transitions. [2023-08-30 16:55:47,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 577 transitions. [2023-08-30 16:55:47,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:47,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 577 transitions. [2023-08-30 16:55:47,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:47,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:47,240 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:47,240 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 160 flow. Second operand 6 states and 577 transitions. [2023-08-30 16:55:47,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 468 flow [2023-08-30 16:55:47,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 338 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-08-30 16:55:47,244 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 184 flow [2023-08-30 16:55:47,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2023-08-30 16:55:47,244 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2023-08-30 16:55:47,245 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 184 flow [2023-08-30 16:55:47,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:47,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:47,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:47,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:55:47,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:47,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -681835562, now seen corresponding path program 2 times [2023-08-30 16:55:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306615371] [2023-08-30 16:55:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:47,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:55:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:55:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:55:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306615371] [2023-08-30 16:55:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306615371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:55:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:55:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:55:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631063657] [2023-08-30 16:55:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:55:48,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:55:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:55:48,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:55:48,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:55:48,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 203 [2023-08-30 16:55:48,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 184 flow. Second operand has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:48,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:55:48,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 203 [2023-08-30 16:55:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:55:48,335 INFO L130 PetriNetUnfolder]: 126/261 cut-off events. [2023-08-30 16:55:48,335 INFO L131 PetriNetUnfolder]: For 244/256 co-relation queries the response was YES. [2023-08-30 16:55:48,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 261 events. 126/261 cut-off events. For 244/256 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 889 event pairs, 24 based on Foata normal form. 13/274 useless extension candidates. Maximal degree in co-relation 858. Up to 133 conditions per place. [2023-08-30 16:55:48,336 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 33 selfloop transitions, 11 changer transitions 19/65 dead transitions. [2023-08-30 16:55:48,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 405 flow [2023-08-30 16:55:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:55:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:55:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-08-30 16:55:48,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44417077175697867 [2023-08-30 16:55:48,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-08-30 16:55:48,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-08-30 16:55:48,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:55:48,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-08-30 16:55:48,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:48,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:48,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:48,343 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 184 flow. Second operand 6 states and 541 transitions. [2023-08-30 16:55:48,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 405 flow [2023-08-30 16:55:48,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:55:48,344 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 199 flow [2023-08-30 16:55:48,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-30 16:55:48,345 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-08-30 16:55:48,345 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 199 flow [2023-08-30 16:55:48,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:55:48,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:55:48,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:48,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:55:48,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:55:48,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:55:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1564516710, now seen corresponding path program 3 times [2023-08-30 16:55:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:55:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218181054] [2023-08-30 16:55:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:55:48,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:55:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:48,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:55:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:55:48,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:55:48,457 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:55:48,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:55:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:55:48,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:55:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:55:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:55:48,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:55:48,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:55:48,462 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:55:48,466 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:55:48,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:55:48,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:55:48 BasicIcfg [2023-08-30 16:55:48,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:55:48,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:55:48,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:55:48,523 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:55:48,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:55:37" (3/4) ... [2023-08-30 16:55:48,525 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:55:48,584 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:55:48,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:55:48,585 INFO L158 Benchmark]: Toolchain (without parser) took 12056.59ms. Allocated memory was 100.7MB in the beginning and 367.0MB in the end (delta: 266.3MB). Free memory was 77.6MB in the beginning and 179.8MB in the end (delta: -102.2MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,585 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 67.1MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:55:48,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.19ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 54.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.26ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 51.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,586 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 80.7MB in the end (delta: -29.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,586 INFO L158 Benchmark]: RCFGBuilder took 581.83ms. Allocated memory is still 100.7MB. Free memory was 80.7MB in the beginning and 43.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,586 INFO L158 Benchmark]: TraceAbstraction took 10855.44ms. Allocated memory was 100.7MB in the beginning and 367.0MB in the end (delta: 266.3MB). Free memory was 42.5MB in the beginning and 189.3MB in the end (delta: -146.8MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,586 INFO L158 Benchmark]: Witness Printer took 61.45ms. Allocated memory is still 367.0MB. Free memory was 189.3MB in the beginning and 179.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 16:55:48,587 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.27ms. Allocated memory is still 67.1MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.19ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 54.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.26ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 51.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 100.7MB. Free memory was 51.7MB in the beginning and 80.7MB in the end (delta: -29.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 581.83ms. Allocated memory is still 100.7MB. Free memory was 80.7MB in the beginning and 43.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10855.44ms. Allocated memory was 100.7MB in the beginning and 367.0MB in the end (delta: 266.3MB). Free memory was 42.5MB in the beginning and 189.3MB in the end (delta: -146.8MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. * Witness Printer took 61.45ms. Allocated memory is still 367.0MB. Free memory was 189.3MB in the beginning and 179.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 113 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 5105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2510, independent: 2331, independent conditional: 0, independent unconditional: 2331, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1050, independent: 1007, independent conditional: 0, independent unconditional: 1007, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2510, independent: 1324, independent conditional: 0, independent unconditional: 1324, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1050, unknown conditional: 0, unknown unconditional: 1050] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-2, t1961={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 823]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 924 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 81 mSDtfsCounter, 924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=12, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 2564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:55:48,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE