./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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 ../sv-benchmarks/c/pthread-wmm/mix033.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:08:14,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:08:14,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:08:14,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:08:14,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:08:14,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:08:14,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:08:14,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:08:14,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:08:14,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:08:14,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:08:14,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:08:14,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:08:14,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:08:14,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:08:14,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:08:14,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:08:14,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:08:14,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:08:14,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:08:14,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:08:14,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:08:14,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:08:14,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:08:14,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:08:14,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:08:14,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:08:14,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:08:14,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:08:14,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:08:14,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:08:14,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:08:14,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:08:14,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:08:14,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:08:14,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:08:14,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:08:14,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:08:14,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:08:14,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:08:14,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:08:14,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:08:14,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:08:14,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:08:14,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:08:14,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:08:14,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:08:14,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:08:14,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:08:14,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:08:14,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:08:14,300 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:08:14,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:08:14,301 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:08:14,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:08:14,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:08:14,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:08:14,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:08:14,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:08:14,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:08:14,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:08:14,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:08:14,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:08:14,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:08:14,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:08:14,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:08:14,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:08:14,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:08:14,305 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:08:14,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:08:14,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:08:14,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2022-07-19 21:08:14,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:08:14,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:08:14,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:08:14,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:08:14,573 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:08:14,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-07-19 21:08:14,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e0e949/eed18955e09948a1a62faed4001aac69/FLAGea11e53f7 [2022-07-19 21:08:15,091 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:08:15,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-07-19 21:08:15,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e0e949/eed18955e09948a1a62faed4001aac69/FLAGea11e53f7 [2022-07-19 21:08:15,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e0e949/eed18955e09948a1a62faed4001aac69 [2022-07-19 21:08:15,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:08:15,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:08:15,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:08:15,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:08:15,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:08:15,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654afd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15, skipping insertion in model container [2022-07-19 21:08:15,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:08:15,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:08:15,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-07-19 21:08:15,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:08:15,482 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:08:15,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-07-19 21:08:15,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:08:15,587 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:08:15,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15 WrapperNode [2022-07-19 21:08:15,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:08:15,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:08:15,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:08:15,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:08:15,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,647 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 186 [2022-07-19 21:08:15,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:08:15,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:08:15,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:08:15,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:08:15,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:08:15,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:08:15,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:08:15,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:08:15,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (1/1) ... [2022-07-19 21:08:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:08:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:08:15,736 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) [2022-07-19 21:08:15,757 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 [2022-07-19 21:08:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:08:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:08:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:08:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:08:15,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:08:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-19 21:08:15,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-19 21:08:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-19 21:08:15,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-19 21:08:15,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-19 21:08:15,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-19 21:08:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:08:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:08:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:08:15,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:08:15,775 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:08:15,922 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:08:15,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:08:16,244 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:08:16,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:08:16,490 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:08:16,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:16 BoogieIcfgContainer [2022-07-19 21:08:16,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:08:16,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:08:16,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:08:16,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:08:16,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:08:15" (1/3) ... [2022-07-19 21:08:16,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153f5202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:08:16, skipping insertion in model container [2022-07-19 21:08:16,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:08:15" (2/3) ... [2022-07-19 21:08:16,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153f5202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:08:16, skipping insertion in model container [2022-07-19 21:08:16,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:16" (3/3) ... [2022-07-19 21:08:16,499 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-07-19 21:08:16,504 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:08:16,511 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:08:16,511 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:08:16,511 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:08:16,589 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-19 21:08:16,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-07-19 21:08:16,672 INFO L129 PetriNetUnfolder]: 2/118 cut-off events. [2022-07-19 21:08:16,673 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:08:16,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-07-19 21:08:16,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-07-19 21:08:16,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-07-19 21:08:16,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:08:16,707 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60ecc2db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4361c0ee [2022-07-19 21:08:16,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-19 21:08:16,736 INFO L129 PetriNetUnfolder]: 0/79 cut-off events. [2022-07-19 21:08:16,736 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:08:16,737 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:16,737 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:16,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -737254169, now seen corresponding path program 1 times [2022-07-19 21:08:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:16,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78864427] [2022-07-19 21:08:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:17,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78864427] [2022-07-19 21:08:17,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78864427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:17,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:17,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:08:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20804840] [2022-07-19 21:08:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:08:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:08:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:08:17,122 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2022-07-19 21:08:17,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:17,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:17,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2022-07-19 21:08:17,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:17,195 INFO L129 PetriNetUnfolder]: 10/188 cut-off events. [2022-07-19 21:08:17,195 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-19 21:08:17,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 188 events. 10/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 389 event pairs, 4 based on Foata normal form. 6/186 useless extension candidates. Maximal degree in co-relation 171. Up to 17 conditions per place. [2022-07-19 21:08:17,207 INFO L132 encePairwiseOnDemand]: 116/121 looper letters, 8 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-07-19 21:08:17,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 261 flow [2022-07-19 21:08:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:08:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:08:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2022-07-19 21:08:17,225 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2022-07-19 21:08:17,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2022-07-19 21:08:17,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2022-07-19 21:08:17,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:17,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2022-07-19 21:08:17,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-07-19 21:08:17,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:17,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:17,239 INFO L186 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 342 transitions. [2022-07-19 21:08:17,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 261 flow [2022-07-19 21:08:17,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:08:17,245 INFO L242 Difference]: Finished difference. Result has 123 places, 114 transitions, 238 flow [2022-07-19 21:08:17,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2022-07-19 21:08:17,250 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2022-07-19 21:08:17,250 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 238 flow [2022-07-19 21:08:17,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:17,251 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:17,251 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:17,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:08:17,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 209728125, now seen corresponding path program 1 times [2022-07-19 21:08:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392747858] [2022-07-19 21:08:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:17,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392747858] [2022-07-19 21:08:17,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392747858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:17,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:17,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626165745] [2022-07-19 21:08:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:17,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:17,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:17,507 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121 [2022-07-19 21:08:17,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:17,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:17,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121 [2022-07-19 21:08:17,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:18,420 INFO L129 PetriNetUnfolder]: 1259/3721 cut-off events. [2022-07-19 21:08:18,421 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-07-19 21:08:18,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 3721 events. 1259/3721 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 33055 event pairs, 375 based on Foata normal form. 0/3610 useless extension candidates. Maximal degree in co-relation 5832. Up to 874 conditions per place. [2022-07-19 21:08:18,445 INFO L132 encePairwiseOnDemand]: 106/121 looper letters, 26 selfloop transitions, 11 changer transitions 70/186 dead transitions. [2022-07-19 21:08:18,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 186 transitions, 590 flow [2022-07-19 21:08:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 935 transitions. [2022-07-19 21:08:18,450 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2022-07-19 21:08:18,450 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 935 transitions. [2022-07-19 21:08:18,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 935 transitions. [2022-07-19 21:08:18,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:18,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 935 transitions. [2022-07-19 21:08:18,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.88888888888889) internal successors, (935), 9 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:18,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:18,459 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:18,459 INFO L186 Difference]: Start difference. First operand has 123 places, 114 transitions, 238 flow. Second operand 9 states and 935 transitions. [2022-07-19 21:08:18,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 186 transitions, 590 flow [2022-07-19 21:08:18,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 186 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:08:18,467 INFO L242 Difference]: Finished difference. Result has 137 places, 108 transitions, 328 flow [2022-07-19 21:08:18,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=328, PETRI_PLACES=137, PETRI_TRANSITIONS=108} [2022-07-19 21:08:18,468 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2022-07-19 21:08:18,468 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 108 transitions, 328 flow [2022-07-19 21:08:18,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:18,469 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:18,469 INFO L200 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:18,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:08:18,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1832762334, now seen corresponding path program 1 times [2022-07-19 21:08:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:18,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096199968] [2022-07-19 21:08:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:18,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096199968] [2022-07-19 21:08:18,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096199968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:18,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:18,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:08:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352870203] [2022-07-19 21:08:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:08:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:18,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:08:18,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:08:18,695 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121 [2022-07-19 21:08:18,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 108 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:18,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:18,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121 [2022-07-19 21:08:18,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:19,313 INFO L129 PetriNetUnfolder]: 767/1933 cut-off events. [2022-07-19 21:08:19,313 INFO L130 PetriNetUnfolder]: For 3137/3153 co-relation queries the response was YES. [2022-07-19 21:08:19,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5725 conditions, 1933 events. 767/1933 cut-off events. For 3137/3153 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13753 event pairs, 210 based on Foata normal form. 54/1925 useless extension candidates. Maximal degree in co-relation 5649. Up to 554 conditions per place. [2022-07-19 21:08:19,329 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 39 selfloop transitions, 7 changer transitions 76/201 dead transitions. [2022-07-19 21:08:19,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 201 transitions, 1104 flow [2022-07-19 21:08:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:08:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:08:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1317 transitions. [2022-07-19 21:08:19,333 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8372536554354736 [2022-07-19 21:08:19,333 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1317 transitions. [2022-07-19 21:08:19,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1317 transitions. [2022-07-19 21:08:19,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:19,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1317 transitions. [2022-07-19 21:08:19,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 101.3076923076923) internal successors, (1317), 13 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,342 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,342 INFO L186 Difference]: Start difference. First operand has 137 places, 108 transitions, 328 flow. Second operand 13 states and 1317 transitions. [2022-07-19 21:08:19,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 201 transitions, 1104 flow [2022-07-19 21:08:19,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 201 transitions, 998 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-07-19 21:08:19,354 INFO L242 Difference]: Finished difference. Result has 141 places, 111 transitions, 384 flow [2022-07-19 21:08:19,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=384, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2022-07-19 21:08:19,355 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places. [2022-07-19 21:08:19,356 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 384 flow [2022-07-19 21:08:19,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,356 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:19,357 INFO L200 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, 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, 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] [2022-07-19 21:08:19,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:08:19,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1596870337, now seen corresponding path program 1 times [2022-07-19 21:08:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:19,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438757213] [2022-07-19 21:08:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:19,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438757213] [2022-07-19 21:08:19,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438757213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:19,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:19,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575399204] [2022-07-19 21:08:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:19,494 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 121 [2022-07-19 21:08:19,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:19,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 121 [2022-07-19 21:08:19,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:19,834 INFO L129 PetriNetUnfolder]: 294/928 cut-off events. [2022-07-19 21:08:19,835 INFO L130 PetriNetUnfolder]: For 2394/2655 co-relation queries the response was YES. [2022-07-19 21:08:19,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2936 conditions, 928 events. 294/928 cut-off events. For 2394/2655 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5835 event pairs, 55 based on Foata normal form. 45/934 useless extension candidates. Maximal degree in co-relation 2856. Up to 302 conditions per place. [2022-07-19 21:08:19,845 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 17 selfloop transitions, 4 changer transitions 31/145 dead transitions. [2022-07-19 21:08:19,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 732 flow [2022-07-19 21:08:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 950 transitions. [2022-07-19 21:08:19,848 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8723599632690542 [2022-07-19 21:08:19,849 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 950 transitions. [2022-07-19 21:08:19,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 950 transitions. [2022-07-19 21:08:19,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:19,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 950 transitions. [2022-07-19 21:08:19,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.55555555555556) internal successors, (950), 9 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,854 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,855 INFO L186 Difference]: Start difference. First operand has 141 places, 111 transitions, 384 flow. Second operand 9 states and 950 transitions. [2022-07-19 21:08:19,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 732 flow [2022-07-19 21:08:19,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 145 transitions, 679 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-07-19 21:08:19,865 INFO L242 Difference]: Finished difference. Result has 140 places, 111 transitions, 381 flow [2022-07-19 21:08:19,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=381, PETRI_PLACES=140, PETRI_TRANSITIONS=111} [2022-07-19 21:08:19,866 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2022-07-19 21:08:19,866 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 111 transitions, 381 flow [2022-07-19 21:08:19,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:19,867 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:19,867 INFO L200 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, 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, 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, 1, 1] [2022-07-19 21:08:19,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:08:19,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 472657106, now seen corresponding path program 1 times [2022-07-19 21:08:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:19,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280559660] [2022-07-19 21:08:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280559660] [2022-07-19 21:08:19,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280559660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:19,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:19,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:08:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337780329] [2022-07-19 21:08:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:19,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:08:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:20,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:08:20,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:08:20,001 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 121 [2022-07-19 21:08:20,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 111 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 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) [2022-07-19 21:08:20,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:20,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 121 [2022-07-19 21:08:20,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:20,627 INFO L129 PetriNetUnfolder]: 1509/3292 cut-off events. [2022-07-19 21:08:20,627 INFO L130 PetriNetUnfolder]: For 3413/5033 co-relation queries the response was YES. [2022-07-19 21:08:20,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7845 conditions, 3292 events. 1509/3292 cut-off events. For 3413/5033 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 26283 event pairs, 90 based on Foata normal form. 2/3053 useless extension candidates. Maximal degree in co-relation 7798. Up to 931 conditions per place. [2022-07-19 21:08:20,656 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 46 selfloop transitions, 15 changer transitions 18/171 dead transitions. [2022-07-19 21:08:20,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 171 transitions, 761 flow [2022-07-19 21:08:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:08:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-19 21:08:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1063 transitions. [2022-07-19 21:08:20,660 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8785123966942149 [2022-07-19 21:08:20,660 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1063 transitions. [2022-07-19 21:08:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1063 transitions. [2022-07-19 21:08:20,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:20,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1063 transitions. [2022-07-19 21:08:20,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:20,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:20,667 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 121.0) internal successors, (1331), 11 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:20,667 INFO L186 Difference]: Start difference. First operand has 140 places, 111 transitions, 381 flow. Second operand 10 states and 1063 transitions. [2022-07-19 21:08:20,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 171 transitions, 761 flow [2022-07-19 21:08:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 171 transitions, 725 flow, removed 14 selfloop flow, removed 14 redundant places. [2022-07-19 21:08:20,676 INFO L242 Difference]: Finished difference. Result has 135 places, 124 transitions, 454 flow [2022-07-19 21:08:20,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=454, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2022-07-19 21:08:20,677 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2022-07-19 21:08:20,677 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 454 flow [2022-07-19 21:08:20,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 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) [2022-07-19 21:08:20,678 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:20,678 INFO L200 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, 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, 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, 1, 1, 1, 1] [2022-07-19 21:08:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:08:20,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1135700997, now seen corresponding path program 1 times [2022-07-19 21:08:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:20,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098006645] [2022-07-19 21:08:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098006645] [2022-07-19 21:08:20,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098006645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:20,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:20,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:08:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336606858] [2022-07-19 21:08:20,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:20,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:08:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:08:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:08:20,807 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 121 [2022-07-19 21:08:20,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 454 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:20,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:20,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 121 [2022-07-19 21:08:20,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:21,505 INFO L129 PetriNetUnfolder]: 1328/3085 cut-off events. [2022-07-19 21:08:21,506 INFO L130 PetriNetUnfolder]: For 6222/7562 co-relation queries the response was YES. [2022-07-19 21:08:21,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10001 conditions, 3085 events. 1328/3085 cut-off events. For 6222/7562 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 25613 event pairs, 76 based on Foata normal form. 166/3112 useless extension candidates. Maximal degree in co-relation 9924. Up to 653 conditions per place. [2022-07-19 21:08:21,527 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 51 selfloop transitions, 28 changer transitions 31/202 dead transitions. [2022-07-19 21:08:21,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 1130 flow [2022-07-19 21:08:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:08:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:08:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1382 transitions. [2022-07-19 21:08:21,532 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8785759694850604 [2022-07-19 21:08:21,532 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1382 transitions. [2022-07-19 21:08:21,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1382 transitions. [2022-07-19 21:08:21,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:21,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1382 transitions. [2022-07-19 21:08:21,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.3076923076923) internal successors, (1382), 13 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:21,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:21,540 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 121.0) internal successors, (1694), 14 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:21,540 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 454 flow. Second operand 13 states and 1382 transitions. [2022-07-19 21:08:21,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 1130 flow [2022-07-19 21:08:21,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 202 transitions, 1128 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:08:21,562 INFO L242 Difference]: Finished difference. Result has 150 places, 142 transitions, 674 flow [2022-07-19 21:08:21,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=674, PETRI_PLACES=150, PETRI_TRANSITIONS=142} [2022-07-19 21:08:21,563 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 24 predicate places. [2022-07-19 21:08:21,563 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 142 transitions, 674 flow [2022-07-19 21:08:21,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:21,563 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:21,564 INFO L200 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:21,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:08:21,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 172637494, now seen corresponding path program 1 times [2022-07-19 21:08:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:21,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399906625] [2022-07-19 21:08:21,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399906625] [2022-07-19 21:08:21,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399906625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:21,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:21,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:08:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704218076] [2022-07-19 21:08:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:21,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:08:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:08:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:08:21,701 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 121 [2022-07-19 21:08:21,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 142 transitions, 674 flow. Second operand has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:21,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:21,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 121 [2022-07-19 21:08:21,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:22,422 INFO L129 PetriNetUnfolder]: 1191/2957 cut-off events. [2022-07-19 21:08:22,422 INFO L130 PetriNetUnfolder]: For 9402/10987 co-relation queries the response was YES. [2022-07-19 21:08:22,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10632 conditions, 2957 events. 1191/2957 cut-off events. For 9402/10987 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 26130 event pairs, 44 based on Foata normal form. 143/2961 useless extension candidates. Maximal degree in co-relation 10549. Up to 594 conditions per place. [2022-07-19 21:08:22,453 INFO L132 encePairwiseOnDemand]: 111/121 looper letters, 48 selfloop transitions, 32 changer transitions 28/200 dead transitions. [2022-07-19 21:08:22,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 200 transitions, 1232 flow [2022-07-19 21:08:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:08:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:08:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1672 transitions. [2022-07-19 21:08:22,459 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2022-07-19 21:08:22,459 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1672 transitions. [2022-07-19 21:08:22,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1672 transitions. [2022-07-19 21:08:22,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:22,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1672 transitions. [2022-07-19 21:08:22,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 104.5) internal successors, (1672), 16 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:22,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:22,470 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 121.0) internal successors, (2057), 17 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:22,470 INFO L186 Difference]: Start difference. First operand has 150 places, 142 transitions, 674 flow. Second operand 16 states and 1672 transitions. [2022-07-19 21:08:22,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 200 transitions, 1232 flow [2022-07-19 21:08:22,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 200 transitions, 1072 flow, removed 65 selfloop flow, removed 8 redundant places. [2022-07-19 21:08:22,562 INFO L242 Difference]: Finished difference. Result has 164 places, 142 transitions, 652 flow [2022-07-19 21:08:22,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=652, PETRI_PLACES=164, PETRI_TRANSITIONS=142} [2022-07-19 21:08:22,563 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 38 predicate places. [2022-07-19 21:08:22,563 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 142 transitions, 652 flow [2022-07-19 21:08:22,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:22,564 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:22,564 INFO L200 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:22,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:08:22,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:22,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1522522456, now seen corresponding path program 1 times [2022-07-19 21:08:22,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:22,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870536215] [2022-07-19 21:08:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:22,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:22,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870536215] [2022-07-19 21:08:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870536215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:22,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:22,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:08:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749384035] [2022-07-19 21:08:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:22,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:08:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:08:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:08:22,681 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 121 [2022-07-19 21:08:22,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 142 transitions, 652 flow. Second operand has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:22,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:22,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 121 [2022-07-19 21:08:22,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:23,049 INFO L129 PetriNetUnfolder]: 384/2038 cut-off events. [2022-07-19 21:08:23,050 INFO L130 PetriNetUnfolder]: For 3863/4022 co-relation queries the response was YES. [2022-07-19 21:08:23,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5632 conditions, 2038 events. 384/2038 cut-off events. For 3863/4022 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 21985 event pairs, 11 based on Foata normal form. 1/1930 useless extension candidates. Maximal degree in co-relation 5546. Up to 269 conditions per place. [2022-07-19 21:08:23,071 INFO L132 encePairwiseOnDemand]: 115/121 looper letters, 21 selfloop transitions, 1 changer transitions 13/156 dead transitions. [2022-07-19 21:08:23,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 784 flow [2022-07-19 21:08:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:08:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:08:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2022-07-19 21:08:23,074 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8547815820543093 [2022-07-19 21:08:23,074 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2022-07-19 21:08:23,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2022-07-19 21:08:23,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:23,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2022-07-19 21:08:23,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,079 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,079 INFO L186 Difference]: Start difference. First operand has 164 places, 142 transitions, 652 flow. Second operand 7 states and 724 transitions. [2022-07-19 21:08:23,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 784 flow [2022-07-19 21:08:23,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 684 flow, removed 28 selfloop flow, removed 14 redundant places. [2022-07-19 21:08:23,139 INFO L242 Difference]: Finished difference. Result has 158 places, 139 transitions, 561 flow [2022-07-19 21:08:23,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=561, PETRI_PLACES=158, PETRI_TRANSITIONS=139} [2022-07-19 21:08:23,142 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 32 predicate places. [2022-07-19 21:08:23,142 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 139 transitions, 561 flow [2022-07-19 21:08:23,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,144 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:23,144 INFO L200 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:23,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:08:23,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -169734862, now seen corresponding path program 2 times [2022-07-19 21:08:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517404320] [2022-07-19 21:08:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:08:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:08:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:08:23,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517404320] [2022-07-19 21:08:23,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517404320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:08:23,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:08:23,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:08:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761918666] [2022-07-19 21:08:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:08:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:08:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:08:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:08:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:08:23,346 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 121 [2022-07-19 21:08:23,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 139 transitions, 561 flow. Second operand has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:08:23,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 121 [2022-07-19 21:08:23,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:08:23,658 INFO L129 PetriNetUnfolder]: 321/1692 cut-off events. [2022-07-19 21:08:23,658 INFO L130 PetriNetUnfolder]: For 2020/2108 co-relation queries the response was YES. [2022-07-19 21:08:23,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4291 conditions, 1692 events. 321/1692 cut-off events. For 2020/2108 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 17617 event pairs, 8 based on Foata normal form. 2/1588 useless extension candidates. Maximal degree in co-relation 4265. Up to 215 conditions per place. [2022-07-19 21:08:23,671 INFO L132 encePairwiseOnDemand]: 113/121 looper letters, 16 selfloop transitions, 5 changer transitions 14/150 dead transitions. [2022-07-19 21:08:23,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 150 transitions, 667 flow [2022-07-19 21:08:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:08:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:08:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 910 transitions. [2022-07-19 21:08:23,674 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8356290174471993 [2022-07-19 21:08:23,674 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 910 transitions. [2022-07-19 21:08:23,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 910 transitions. [2022-07-19 21:08:23,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:08:23,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 910 transitions. [2022-07-19 21:08:23,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,679 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 121.0) internal successors, (1210), 10 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,680 INFO L186 Difference]: Start difference. First operand has 158 places, 139 transitions, 561 flow. Second operand 9 states and 910 transitions. [2022-07-19 21:08:23,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 150 transitions, 667 flow [2022-07-19 21:08:23,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 150 transitions, 652 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-07-19 21:08:23,712 INFO L242 Difference]: Finished difference. Result has 164 places, 136 transitions, 563 flow [2022-07-19 21:08:23,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=563, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2022-07-19 21:08:23,713 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 38 predicate places. [2022-07-19 21:08:23,714 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 563 flow [2022-07-19 21:08:23,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:08:23,714 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:08:23,715 INFO L200 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:23,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:08:23,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-19 21:08:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:08:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 185923018, now seen corresponding path program 3 times [2022-07-19 21:08:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:08:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156252835] [2022-07-19 21:08:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:08:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:08:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:08:23,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:08:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:08:23,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:08:23,851 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:08:23,853 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-19 21:08:23,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-19 21:08:23,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-19 21:08:23,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-19 21:08:23,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-19 21:08:23,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-19 21:08:23,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:08:23,858 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:08:23,863 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:08:23,863 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:08:24,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:08:24 BasicIcfg [2022-07-19 21:08:24,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:08:24,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:08:24,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:08:24,011 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:08:24,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:08:16" (3/4) ... [2022-07-19 21:08:24,013 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:08:24,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:08:24,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:08:24,101 INFO L158 Benchmark]: Toolchain (without parser) took 8976.74ms. Allocated memory was 92.3MB in the beginning and 675.3MB in the end (delta: 583.0MB). Free memory was 58.7MB in the beginning and 346.3MB in the end (delta: -287.7MB). Peak memory consumption was 294.9MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,101 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:08:24,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.82ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.5MB in the beginning and 74.5MB in the end (delta: -16.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.29ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 71.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,102 INFO L158 Benchmark]: Boogie Preprocessor took 50.26ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,103 INFO L158 Benchmark]: RCFGBuilder took 788.24ms. Allocated memory is still 111.1MB. Free memory was 69.7MB in the beginning and 50.7MB in the end (delta: 19.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,103 INFO L158 Benchmark]: TraceAbstraction took 7515.71ms. Allocated memory was 111.1MB in the beginning and 675.3MB in the end (delta: 564.1MB). Free memory was 50.1MB in the beginning and 382.0MB in the end (delta: -331.9MB). Peak memory consumption was 232.3MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,103 INFO L158 Benchmark]: Witness Printer took 90.18ms. Allocated memory is still 675.3MB. Free memory was 382.0MB in the beginning and 346.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-19 21:08:24,105 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.18ms. Allocated memory is still 92.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.82ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.5MB in the beginning and 74.5MB in the end (delta: -16.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.29ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 71.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.26ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.24ms. Allocated memory is still 111.1MB. Free memory was 69.7MB in the beginning and 50.7MB in the end (delta: 19.1MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7515.71ms. Allocated memory was 111.1MB in the beginning and 675.3MB in the end (delta: 564.1MB). Free memory was 50.1MB in the beginning and 382.0MB in the end (delta: -331.9MB). Peak memory consumption was 232.3MB. Max. memory is 16.1GB. * Witness Printer took 90.18ms. Allocated memory is still 675.3MB. Free memory was 382.0MB in the beginning and 346.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t876; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-2, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-1, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 449 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 106 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=6, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 3399 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-07-19 21:08:24,146 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