./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --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:52:05,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:52:05,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:52:05,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:52:05,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:52:05,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:52:05,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:52:05,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:52:05,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:52:05,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:52:05,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:52:05,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:52:05,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:52:05,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:52:05,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:52:05,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:52:05,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:52:05,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:52:05,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:52:05,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:52:05,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:52:05,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:52:05,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:52:05,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:52:05,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:52:05,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:52:05,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:52:05,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:52:05,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:52:05,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:52:05,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:52:05,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:52:05,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:52:05,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:52:05,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:52:05,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:52:05,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:52:05,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:52:05,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:52:05,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:52:05,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:52:05,263 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:52:05,296 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:52:05,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:52:05,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:52:05,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:52:05,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:52:05,297 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:52:05,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:52:05,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:52:05,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:52:05,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:52:05,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:05,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:52:05,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:52:05,301 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:52:05,301 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 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:52:05,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:52:05,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:52:05,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:52:05,648 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:52:05,648 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:52:05,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-30 16:52:06,865 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:52:07,168 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:52:07,168 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-30 16:52:07,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3a71a24/45dd2886041c40e59fb4fe4639316e78/FLAGba676b2d9 [2023-08-30 16:52:07,195 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd3a71a24/45dd2886041c40e59fb4fe4639316e78 [2023-08-30 16:52:07,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:52:07,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:52:07,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:07,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:52:07,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:52:07,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34718f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07, skipping insertion in model container [2023-08-30 16:52:07,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:52:07,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:52:07,432 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-30 16:52:07,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:07,657 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:52:07,668 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-30 16:52:07,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:52:07,781 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:07,781 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:52:07,786 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:52:07,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07 WrapperNode [2023-08-30 16:52:07,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:52:07,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:07,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:52:07,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:52:07,794 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:52:07" (1/1) ... [2023-08-30 16:52:07,823 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:52:07" (1/1) ... [2023-08-30 16:52:07,861 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 16:52:07,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:52:07,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:52:07,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:52:07,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:52:07,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:52:07,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:52:07,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:52:07,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:52:07,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (1/1) ... [2023-08-30 16:52:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:52:07,948 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:52:07,971 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:52:07,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:52:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:52:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:52:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:52:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:52:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:52:07,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:52:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:52:07,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:52:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:52:07,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:52:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:52:07,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:52:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:52:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:52:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:52:07,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:52:07,988 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:52:08,134 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:52:08,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:52:08,459 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:52:08,675 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:52:08,676 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:52:08,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:08 BoogieIcfgContainer [2023-08-30 16:52:08,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:52:08,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:52:08,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:52:08,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:52:08,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:52:07" (1/3) ... [2023-08-30 16:52:08,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21433ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:08, skipping insertion in model container [2023-08-30 16:52:08,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:52:07" (2/3) ... [2023-08-30 16:52:08,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21433ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:52:08, skipping insertion in model container [2023-08-30 16:52:08,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:08" (3/3) ... [2023-08-30 16:52:08,686 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-30 16:52:08,694 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:52:08,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:52:08,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:52:08,703 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:52:08,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:52:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-30 16:52:08,851 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-08-30 16:52:08,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:08,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:08,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-30 16:52:08,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-30 16:52:08,873 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:52:08,890 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-30 16:52:08,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-30 16:52:08,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-30 16:52:08,938 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-08-30 16:52:08,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:52:08,943 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-08-30 16:52:12,627 INFO L134 LiptonReduction]: Checked pairs total: 9058 [2023-08-30 16:52:12,628 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-30 16:52:12,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:52:12,653 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;@4badec7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:52:12,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:52:12,655 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:52:12,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:52:12,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:12,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:52:12,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:12,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash 539702, now seen corresponding path program 1 times [2023-08-30 16:52:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709909871] [2023-08-30 16:52:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:13,038 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:52:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709909871] [2023-08-30 16:52:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709909871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:13,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:52:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964510633] [2023-08-30 16:52:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:13,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:52:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:13,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:52:13,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:52:13,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 233 [2023-08-30 16:52:13,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:52:13,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:13,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 233 [2023-08-30 16:52:13,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:14,194 INFO L130 PetriNetUnfolder]: 6855/9422 cut-off events. [2023-08-30 16:52:14,194 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 16:52:14,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18862 conditions, 9422 events. 6855/9422 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 48367 event pairs, 2603 based on Foata normal form. 320/9097 useless extension candidates. Maximal degree in co-relation 18850. Up to 7399 conditions per place. [2023-08-30 16:52:14,246 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 43 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-08-30 16:52:14,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 223 flow [2023-08-30 16:52:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:52:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:52:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2023-08-30 16:52:14,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5593705293276109 [2023-08-30 16:52:14,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2023-08-30 16:52:14,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2023-08-30 16:52:14,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:14,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2023-08-30 16:52:14,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 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:52:14,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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:52:14,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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:52:14,285 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 391 transitions. [2023-08-30 16:52:14,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 223 flow [2023-08-30 16:52:14,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:52:14,292 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-30 16:52:14,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-30 16:52:14,300 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 16:52:14,301 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-30 16:52:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:52:14,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:14,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:14,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:52:14,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:14,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 231542138, now seen corresponding path program 1 times [2023-08-30 16:52:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775108074] [2023-08-30 16:52:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:14,699 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:52:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775108074] [2023-08-30 16:52:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775108074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:14,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:14,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:52:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185660372] [2023-08-30 16:52:14,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:14,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:14,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-30 16:52:14,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:52:14,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:14,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-30 16:52:14,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:15,802 INFO L130 PetriNetUnfolder]: 6835/9588 cut-off events. [2023-08-30 16:52:15,802 INFO L131 PetriNetUnfolder]: For 481/481 co-relation queries the response was YES. [2023-08-30 16:52:15,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19652 conditions, 9588 events. 6835/9588 cut-off events. For 481/481 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 50820 event pairs, 2481 based on Foata normal form. 400/9985 useless extension candidates. Maximal degree in co-relation 19642. Up to 7711 conditions per place. [2023-08-30 16:52:15,846 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 41 selfloop transitions, 3 changer transitions 25/71 dead transitions. [2023-08-30 16:52:15,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 304 flow [2023-08-30 16:52:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:52:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:52:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-08-30 16:52:15,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201716738197425 [2023-08-30 16:52:15,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-08-30 16:52:15,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-08-30 16:52:15,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:15,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-08-30 16:52:15,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 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:52:15,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:15,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:15,854 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 606 transitions. [2023-08-30 16:52:15,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 304 flow [2023-08-30 16:52:15,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:15,856 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-08-30 16:52:15,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-30 16:52:15,857 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-08-30 16:52:15,857 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-08-30 16:52:15,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:52:15,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:15,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:15,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:52:15,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:15,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1412146843, now seen corresponding path program 1 times [2023-08-30 16:52:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882200315] [2023-08-30 16:52:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:16,098 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:52:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882200315] [2023-08-30 16:52:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882200315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:52:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182706285] [2023-08-30 16:52:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:16,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 16:52:16,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:52:16,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:16,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 16:52:16,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:16,882 INFO L130 PetriNetUnfolder]: 4478/6431 cut-off events. [2023-08-30 16:52:16,883 INFO L131 PetriNetUnfolder]: For 1309/1309 co-relation queries the response was YES. [2023-08-30 16:52:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14692 conditions, 6431 events. 4478/6431 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34393 event pairs, 828 based on Foata normal form. 380/6796 useless extension candidates. Maximal degree in co-relation 14679. Up to 4475 conditions per place. [2023-08-30 16:52:16,928 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 60 selfloop transitions, 9 changer transitions 6/79 dead transitions. [2023-08-30 16:52:16,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 366 flow [2023-08-30 16:52:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:52:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:52:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-30 16:52:16,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133047210300429 [2023-08-30 16:52:16,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-30 16:52:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-30 16:52:16,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:16,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-30 16:52:16,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:52:16,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:16,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:16,936 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 5 states and 598 transitions. [2023-08-30 16:52:16,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 366 flow [2023-08-30 16:52:16,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:16,959 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 155 flow [2023-08-30 16:52:16,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-30 16:52:16,960 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-08-30 16:52:16,963 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 155 flow [2023-08-30 16:52:16,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:52:16,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:16,964 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:52:16,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:52:16,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:16,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash 743990271, now seen corresponding path program 1 times [2023-08-30 16:52:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974088196] [2023-08-30 16:52:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:17,227 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:52:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:17,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974088196] [2023-08-30 16:52:17,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974088196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:17,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:52:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547039697] [2023-08-30 16:52:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:17,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:52:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:52:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:52:17,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-30 16:52:17,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:52:17,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:17,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-30 16:52:17,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:18,426 INFO L130 PetriNetUnfolder]: 6980/10159 cut-off events. [2023-08-30 16:52:18,426 INFO L131 PetriNetUnfolder]: For 7103/7103 co-relation queries the response was YES. [2023-08-30 16:52:18,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 10159 events. 6980/10159 cut-off events. For 7103/7103 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 60556 event pairs, 3028 based on Foata normal form. 276/10414 useless extension candidates. Maximal degree in co-relation 29272. Up to 5533 conditions per place. [2023-08-30 16:52:18,504 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 52 selfloop transitions, 3 changer transitions 33/90 dead transitions. [2023-08-30 16:52:18,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 90 transitions, 531 flow [2023-08-30 16:52:18,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:52:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:52:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-30 16:52:18,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-08-30 16:52:18,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-30 16:52:18,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-30 16:52:18,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:18,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-30 16:52:18,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 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:52:18,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:18,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:18,512 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 155 flow. Second operand 5 states and 608 transitions. [2023-08-30 16:52:18,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 90 transitions, 531 flow [2023-08-30 16:52:18,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 518 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:52:18,530 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 139 flow [2023-08-30 16:52:18,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2023-08-30 16:52:18,531 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-30 16:52:18,531 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 139 flow [2023-08-30 16:52:18,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:52:18,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:18,532 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:52:18,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:52:18,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:18,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1984947899, now seen corresponding path program 1 times [2023-08-30 16:52:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654795078] [2023-08-30 16:52:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:18,728 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:52:18,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:18,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654795078] [2023-08-30 16:52:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654795078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:52:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541965419] [2023-08-30 16:52:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:18,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:52:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:18,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:52:18,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:52:18,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 16:52:18,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:52:18,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:18,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 16:52:18,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:19,328 INFO L130 PetriNetUnfolder]: 3095/4696 cut-off events. [2023-08-30 16:52:19,328 INFO L131 PetriNetUnfolder]: For 2846/2857 co-relation queries the response was YES. [2023-08-30 16:52:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13510 conditions, 4696 events. 3095/4696 cut-off events. For 2846/2857 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 26301 event pairs, 587 based on Foata normal form. 345/5021 useless extension candidates. Maximal degree in co-relation 13491. Up to 1863 conditions per place. [2023-08-30 16:52:19,356 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 55 selfloop transitions, 9 changer transitions 29/97 dead transitions. [2023-08-30 16:52:19,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 539 flow [2023-08-30 16:52:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:52:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:52:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2023-08-30 16:52:19,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150214592274678 [2023-08-30 16:52:19,359 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2023-08-30 16:52:19,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2023-08-30 16:52:19,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:19,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2023-08-30 16:52:19,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:52:19,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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:52:19,364 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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:52:19,364 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 139 flow. Second operand 6 states and 720 transitions. [2023-08-30 16:52:19,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 539 flow [2023-08-30 16:52:19,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 97 transitions, 516 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-30 16:52:19,387 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 200 flow [2023-08-30 16:52:19,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-30 16:52:19,388 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-08-30 16:52:19,388 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 200 flow [2023-08-30 16:52:19,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:52:19,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:19,389 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] [2023-08-30 16:52:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:52:19,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:19,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1766977200, now seen corresponding path program 1 times [2023-08-30 16:52:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110538934] [2023-08-30 16:52:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:19,645 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:52:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:19,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110538934] [2023-08-30 16:52:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110538934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:52:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853066463] [2023-08-30 16:52:19,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:52:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:52:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:52:19,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 16:52:19,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:52:19,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:19,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 16:52:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:20,131 INFO L130 PetriNetUnfolder]: 1830/2829 cut-off events. [2023-08-30 16:52:20,131 INFO L131 PetriNetUnfolder]: For 3064/3065 co-relation queries the response was YES. [2023-08-30 16:52:20,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9047 conditions, 2829 events. 1830/2829 cut-off events. For 3064/3065 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14967 event pairs, 471 based on Foata normal form. 133/2943 useless extension candidates. Maximal degree in co-relation 9027. Up to 975 conditions per place. [2023-08-30 16:52:20,146 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 66 selfloop transitions, 13 changer transitions 28/111 dead transitions. [2023-08-30 16:52:20,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 111 transitions, 688 flow [2023-08-30 16:52:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:52:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:52:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-30 16:52:20,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150214592274678 [2023-08-30 16:52:20,149 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-30 16:52:20,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-30 16:52:20,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:20,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-30 16:52:20,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:52:20,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:52:20,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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:52:20,154 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 200 flow. Second operand 7 states and 840 transitions. [2023-08-30 16:52:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 111 transitions, 688 flow [2023-08-30 16:52:20,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 111 transitions, 626 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 16:52:20,189 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 250 flow [2023-08-30 16:52:20,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-30 16:52:20,190 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-08-30 16:52:20,190 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 250 flow [2023-08-30 16:52:20,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:52:20,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:20,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:20,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:52:20,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:20,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1863525091, now seen corresponding path program 1 times [2023-08-30 16:52:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675150553] [2023-08-30 16:52:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:20,478 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:52:20,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:20,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675150553] [2023-08-30 16:52:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675150553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:20,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:52:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455905468] [2023-08-30 16:52:20,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:20,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:52:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:52:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:52:20,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-30 16:52:20,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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:52:20,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:20,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-30 16:52:20,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:20,881 INFO L130 PetriNetUnfolder]: 1564/2376 cut-off events. [2023-08-30 16:52:20,881 INFO L131 PetriNetUnfolder]: For 2527/2527 co-relation queries the response was YES. [2023-08-30 16:52:20,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 2376 events. 1564/2376 cut-off events. For 2527/2527 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12274 event pairs, 462 based on Foata normal form. 26/2383 useless extension candidates. Maximal degree in co-relation 7257. Up to 975 conditions per place. [2023-08-30 16:52:20,893 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 58 selfloop transitions, 17 changer transitions 19/97 dead transitions. [2023-08-30 16:52:20,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 616 flow [2023-08-30 16:52:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:52:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:52:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 932 transitions. [2023-08-30 16:52:20,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 16:52:20,896 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 932 transitions. [2023-08-30 16:52:20,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 932 transitions. [2023-08-30 16:52:20,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:20,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 932 transitions. [2023-08-30 16:52:20,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.5) internal successors, (932), 8 states have internal predecessors, (932), 0 states have call successors, (0), 0 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:52:20,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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:52:20,902 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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:52:20,902 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 250 flow. Second operand 8 states and 932 transitions. [2023-08-30 16:52:20,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 616 flow [2023-08-30 16:52:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 548 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-30 16:52:20,931 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 228 flow [2023-08-30 16:52:20,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2023-08-30 16:52:20,932 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-08-30 16:52:20,932 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 228 flow [2023-08-30 16:52:20,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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:52:20,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:20,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:20,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:52:20,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:20,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash -474946056, now seen corresponding path program 1 times [2023-08-30 16:52:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850684160] [2023-08-30 16:52:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:22,222 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:52:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850684160] [2023-08-30 16:52:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850684160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:22,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:52:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868816761] [2023-08-30 16:52:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:22,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:52:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:52:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:52:22,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 16:52:22,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 0 states have call successors, (0), 0 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:52:22,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:22,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 16:52:22,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:22,758 INFO L130 PetriNetUnfolder]: 928/1493 cut-off events. [2023-08-30 16:52:22,759 INFO L131 PetriNetUnfolder]: For 1894/1894 co-relation queries the response was YES. [2023-08-30 16:52:22,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 1493 events. 928/1493 cut-off events. For 1894/1894 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7365 event pairs, 48 based on Foata normal form. 1/1493 useless extension candidates. Maximal degree in co-relation 4655. Up to 773 conditions per place. [2023-08-30 16:52:22,767 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 62 selfloop transitions, 4 changer transitions 32/101 dead transitions. [2023-08-30 16:52:22,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 765 flow [2023-08-30 16:52:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:52:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:52:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 899 transitions. [2023-08-30 16:52:22,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822961373390558 [2023-08-30 16:52:22,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 899 transitions. [2023-08-30 16:52:22,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 899 transitions. [2023-08-30 16:52:22,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:22,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 899 transitions. [2023-08-30 16:52:22,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.375) internal successors, (899), 8 states have internal predecessors, (899), 0 states have call successors, (0), 0 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:52:22,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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:52:22,777 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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:52:22,777 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 228 flow. Second operand 8 states and 899 transitions. [2023-08-30 16:52:22,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 765 flow [2023-08-30 16:52:22,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 604 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-08-30 16:52:22,790 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 172 flow [2023-08-30 16:52:22,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-30 16:52:22,791 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-08-30 16:52:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 172 flow [2023-08-30 16:52:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 0 states have call successors, (0), 0 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:52:22,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:22,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:52:22,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:22,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1405638462, now seen corresponding path program 2 times [2023-08-30 16:52:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020213971] [2023-08-30 16:52:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:52:23,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:23,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020213971] [2023-08-30 16:52:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020213971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:23,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:52:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899013692] [2023-08-30 16:52:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:52:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:52:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:52:23,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-30 16:52:23,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:23,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:23,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-30 16:52:23,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:23,484 INFO L130 PetriNetUnfolder]: 1262/2061 cut-off events. [2023-08-30 16:52:23,484 INFO L131 PetriNetUnfolder]: For 1987/1988 co-relation queries the response was YES. [2023-08-30 16:52:23,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5801 conditions, 2061 events. 1262/2061 cut-off events. For 1987/1988 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10739 event pairs, 172 based on Foata normal form. 1/2061 useless extension candidates. Maximal degree in co-relation 5788. Up to 1018 conditions per place. [2023-08-30 16:52:23,494 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 53 selfloop transitions, 1 changer transitions 30/86 dead transitions. [2023-08-30 16:52:23,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 554 flow [2023-08-30 16:52:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:52:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:52:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-30 16:52:23,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021459227467812 [2023-08-30 16:52:23,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-30 16:52:23,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-30 16:52:23,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:23,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-30 16:52:23,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:52:23,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:23,501 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:52:23,501 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 172 flow. Second operand 5 states and 585 transitions. [2023-08-30 16:52:23,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 554 flow [2023-08-30 16:52:23,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 532 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-30 16:52:23,516 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 169 flow [2023-08-30 16:52:23,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-30 16:52:23,517 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-08-30 16:52:23,518 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 169 flow [2023-08-30 16:52:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:23,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:23,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:23,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:52:23,519 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:23,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1360576838, now seen corresponding path program 3 times [2023-08-30 16:52:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362766503] [2023-08-30 16:52:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:23,830 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:52:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362766503] [2023-08-30 16:52:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362766503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:52:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677892923] [2023-08-30 16:52:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:23,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:52:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:52:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:52:23,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 16:52:23,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:52:23,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:23,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 16:52:23,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:24,245 INFO L130 PetriNetUnfolder]: 1566/2462 cut-off events. [2023-08-30 16:52:24,245 INFO L131 PetriNetUnfolder]: For 2148/2148 co-relation queries the response was YES. [2023-08-30 16:52:24,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 2462 events. 1566/2462 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11482 event pairs, 247 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 6917. Up to 964 conditions per place. [2023-08-30 16:52:24,254 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 57 selfloop transitions, 7 changer transitions 39/103 dead transitions. [2023-08-30 16:52:24,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 103 transitions, 646 flow [2023-08-30 16:52:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:52:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:52:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2023-08-30 16:52:24,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48068669527896996 [2023-08-30 16:52:24,257 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 672 transitions. [2023-08-30 16:52:24,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions. [2023-08-30 16:52:24,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:24,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions. [2023-08-30 16:52:24,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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:52:24,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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:52:24,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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:52:24,262 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 169 flow. Second operand 6 states and 672 transitions. [2023-08-30 16:52:24,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 103 transitions, 646 flow [2023-08-30 16:52:24,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 103 transitions, 636 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:52:24,284 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 217 flow [2023-08-30 16:52:24,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-30 16:52:24,285 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-08-30 16:52:24,285 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 217 flow [2023-08-30 16:52:24,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:52:24,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:24,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:24,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:52:24,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:24,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1512706566, now seen corresponding path program 4 times [2023-08-30 16:52:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977568863] [2023-08-30 16:52:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:24,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:52:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:24,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:52:24,434 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:52:24,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:52:24,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:52:24,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:52:24,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:52:24,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:52:24,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:52:24,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:52:24,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:52:24,437 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:24,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:52:24,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:52:24,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:52:24 BasicIcfg [2023-08-30 16:52:24,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:52:24,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:52:24,508 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:52:24,508 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:52:24,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:52:08" (3/4) ... [2023-08-30 16:52:24,510 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:52:24,600 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:52:24,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:52:24,601 INFO L158 Benchmark]: Toolchain (without parser) took 17402.78ms. Allocated memory was 79.7MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 56.7MB in the beginning and 786.9MB in the end (delta: -730.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 16:52:24,601 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:52:24,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.56ms. Allocated memory is still 79.7MB. Free memory was 56.4MB in the beginning and 52.3MB in the end (delta: 4.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-08-30 16:52:24,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.34ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:52:24,602 INFO L158 Benchmark]: Boogie Preprocessor took 52.03ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:52:24,602 INFO L158 Benchmark]: RCFGBuilder took 762.76ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 31.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-08-30 16:52:24,602 INFO L158 Benchmark]: TraceAbstraction took 15827.21ms. Allocated memory was 79.7MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 31.1MB in the beginning and 802.6MB in the end (delta: -771.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 16:52:24,603 INFO L158 Benchmark]: Witness Printer took 92.50ms. Allocated memory is still 1.9GB. Free memory was 802.6MB in the beginning and 786.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:52:24,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.56ms. Allocated memory is still 79.7MB. Free memory was 56.4MB in the beginning and 52.3MB in the end (delta: 4.2MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.34ms. Allocated memory is still 79.7MB. Free memory was 52.3MB in the beginning and 49.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.03ms. Allocated memory is still 79.7MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.76ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 31.5MB in the end (delta: 16.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15827.21ms. Allocated memory was 79.7MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 31.1MB in the beginning and 802.6MB in the end (delta: -771.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 92.50ms. Allocated memory is still 1.9GB. Free memory was 802.6MB in the beginning and 786.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 136 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 32 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 9058 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3586, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1601, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3586, independent: 1777, independent conditional: 0, independent unconditional: 1777, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1601, unknown conditional: 0, unknown unconditional: 1601] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-2, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L863] 0 pthread_t t1354; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=1, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 348 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1711 IncrementalHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 88 mSDtfsCounter, 1711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:52:24,625 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