./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix005.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/mix005.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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:20:47,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:20:47,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:20:47,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:20:47,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:20:47,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:20:47,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:20:47,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:20:47,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:20:47,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:20:47,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:20:47,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:20:47,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:20:47,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:20:47,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:20:47,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:20:47,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:20:47,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:20:47,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:20:47,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:20:47,555 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:20:47,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:20:47,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:20:47,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:20:47,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:20:47,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:20:47,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:20:47,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:20:47,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:20:47,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:20:47,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:20:47,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:20:47,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:20:47,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:20:47,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:20:47,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:20:47,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:20:47,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:20:47,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:20:47,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:20:47,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:20:47,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:20:47,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:20:47,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:20:47,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:20:47,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:20:47,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:20:47,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:20:47,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:20:47,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:20:47,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:20:47,603 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:20:47,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:20:47,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:20:47,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:20:47,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:20:47,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:20:47,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:20:47,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:20:47,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:20:47,605 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:20:47,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:20:47,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:20:47,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:20:47,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:20:47,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:20:47,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:20:47,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:20:47,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:20:47,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:20:47,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:20:47,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:20:47,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:20:47,620 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:20:47,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:20:47,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:20:47,621 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 [2022-07-22 21:20:47,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:20:47,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:20:47,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:20:47,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:20:47,875 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:20:47,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-07-22 21:20:47,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8697ff/fe23135fc55846b3b33bb0cef38e0240/FLAG21839cfdb [2022-07-22 21:20:48,469 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:20:48,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-07-22 21:20:48,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8697ff/fe23135fc55846b3b33bb0cef38e0240/FLAG21839cfdb [2022-07-22 21:20:48,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8697ff/fe23135fc55846b3b33bb0cef38e0240 [2022-07-22 21:20:48,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:20:48,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:20:48,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:20:48,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:20:48,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:20:48,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:20:48" (1/1) ... [2022-07-22 21:20:48,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d21ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:48, skipping insertion in model container [2022-07-22 21:20:48,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:20:48" (1/1) ... [2022-07-22 21:20:48,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:20:48,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:20:48,949 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/mix005.opt.i[944,957] [2022-07-22 21:20:49,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:20:49,108 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:20:49,118 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/mix005.opt.i[944,957] [2022-07-22 21:20:49,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:20:49,189 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:20:49,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49 WrapperNode [2022-07-22 21:20:49,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:20:49,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:20:49,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:20:49,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:20:49,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,258 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 296 [2022-07-22 21:20:49,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:20:49,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:20:49,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:20:49,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:20:49,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:20:49,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:20:49,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:20:49,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:20:49,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (1/1) ... [2022-07-22 21:20:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:20:49,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:20:49,348 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-22 21:20:49,355 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-22 21:20:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:20:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:20:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:20:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:20:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:20:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-22 21:20:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-22 21:20:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-22 21:20:49,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-22 21:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-22 21:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-22 21:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-22 21:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-22 21:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:20:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:20:49,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:20:49,394 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:20:49,532 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:20:49,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:20:50,060 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:20:50,429 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:20:50,430 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 21:20:50,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:50 BoogieIcfgContainer [2022-07-22 21:20:50,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:20:50,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:20:50,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:20:50,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:20:50,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:20:48" (1/3) ... [2022-07-22 21:20:50,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7420441f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:20:50, skipping insertion in model container [2022-07-22 21:20:50,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:20:49" (2/3) ... [2022-07-22 21:20:50,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7420441f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:20:50, skipping insertion in model container [2022-07-22 21:20:50,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:50" (3/3) ... [2022-07-22 21:20:50,442 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2022-07-22 21:20:50,447 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:20:50,455 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:20:50,456 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:20:50,456 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:20:50,551 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-22 21:20:50,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-07-22 21:20:50,665 INFO L129 PetriNetUnfolder]: 2/133 cut-off events. [2022-07-22 21:20:50,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:20:50,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-07-22 21:20:50,669 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-07-22 21:20:50,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-07-22 21:20:50,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:20:50,696 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@6bb430dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ef1bbe6 [2022-07-22 21:20:50,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-22 21:20:50,724 INFO L129 PetriNetUnfolder]: 0/93 cut-off events. [2022-07-22 21:20:50,724 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:20:50,724 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:50,725 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] [2022-07-22 21:20:50,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 488251171, now seen corresponding path program 1 times [2022-07-22 21:20:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:50,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986527901] [2022-07-22 21:20:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:51,089 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-22 21:20:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:51,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986527901] [2022-07-22 21:20:51,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986527901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:51,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:51,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:20:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809786431] [2022-07-22 21:20:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:20:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:20:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:20:51,134 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-07-22 21:20:51,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-22 21:20:51,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:51,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-07-22 21:20:51,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:51,272 INFO L129 PetriNetUnfolder]: 14/214 cut-off events. [2022-07-22 21:20:51,276 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-22 21:20:51,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 214 events. 14/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 464 event pairs, 6 based on Foata normal form. 6/209 useless extension candidates. Maximal degree in co-relation 206. Up to 25 conditions per place. [2022-07-22 21:20:51,283 INFO L132 encePairwiseOnDemand]: 132/137 looper letters, 10 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-07-22 21:20:51,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 131 transitions, 298 flow [2022-07-22 21:20:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:20:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:20:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-07-22 21:20:51,305 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9391727493917275 [2022-07-22 21:20:51,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-07-22 21:20:51,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-07-22 21:20:51,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:51,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-07-22 21:20:51,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-22 21:20:51,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-22 21:20:51,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 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-22 21:20:51,328 INFO L186 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 386 transitions. [2022-07-22 21:20:51,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 131 transitions, 298 flow [2022-07-22 21:20:51,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 131 transitions, 294 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:20:51,336 INFO L242 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-07-22 21:20:51,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-07-22 21:20:51,343 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-07-22 21:20:51,344 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-07-22 21:20:51,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-22 21:20:51,345 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:51,345 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] [2022-07-22 21:20:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:20:51,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1847271632, now seen corresponding path program 1 times [2022-07-22 21:20:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89184554] [2022-07-22 21:20:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:51,712 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-22 21:20:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:51,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89184554] [2022-07-22 21:20:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89184554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:51,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:51,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:20:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069923277] [2022-07-22 21:20:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:51,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:20:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:20:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:20:51,723 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-07-22 21:20:51,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 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-22 21:20:51,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:51,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-07-22 21:20:51,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:53,215 INFO L129 PetriNetUnfolder]: 3015/7278 cut-off events. [2022-07-22 21:20:53,215 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-22 21:20:53,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11815 conditions, 7278 events. 3015/7278 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65772 event pairs, 390 based on Foata normal form. 0/7117 useless extension candidates. Maximal degree in co-relation 11752. Up to 1641 conditions per place. [2022-07-22 21:20:53,264 INFO L132 encePairwiseOnDemand]: 123/137 looper letters, 33 selfloop transitions, 10 changer transitions 89/221 dead transitions. [2022-07-22 21:20:53,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 221 transitions, 698 flow [2022-07-22 21:20:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:20:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:20:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1500 transitions. [2022-07-22 21:20:53,269 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8422234699606962 [2022-07-22 21:20:53,269 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1500 transitions. [2022-07-22 21:20:53,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1500 transitions. [2022-07-22 21:20:53,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:53,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1500 transitions. [2022-07-22 21:20:53,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.38461538461539) internal successors, (1500), 13 states have internal predecessors, (1500), 0 states have call successors, (0), 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-22 21:20:53,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:20:53,278 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:20:53,278 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1500 transitions. [2022-07-22 21:20:53,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 221 transitions, 698 flow [2022-07-22 21:20:53,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 221 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:20:53,284 INFO L242 Difference]: Finished difference. Result has 162 places, 121 transitions, 360 flow [2022-07-22 21:20:53,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=360, PETRI_PLACES=162, PETRI_TRANSITIONS=121} [2022-07-22 21:20:53,285 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-07-22 21:20:53,285 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 121 transitions, 360 flow [2022-07-22 21:20:53,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 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-22 21:20:53,286 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:53,286 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] [2022-07-22 21:20:53,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:20:53,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -576544474, now seen corresponding path program 1 times [2022-07-22 21:20:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:53,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011554493] [2022-07-22 21:20:53,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:53,537 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-22 21:20:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:53,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011554493] [2022-07-22 21:20:53,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011554493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:53,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:53,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:20:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744098856] [2022-07-22 21:20:53,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:53,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:20:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:20:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:20:53,541 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-07-22 21:20:53,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 121 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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-22 21:20:53,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:53,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-07-22 21:20:53,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:54,544 INFO L129 PetriNetUnfolder]: 1919/3926 cut-off events. [2022-07-22 21:20:54,545 INFO L130 PetriNetUnfolder]: For 9880/9896 co-relation queries the response was YES. [2022-07-22 21:20:54,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 3926 events. 1919/3926 cut-off events. For 9880/9896 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 28271 event pairs, 383 based on Foata normal form. 80/3897 useless extension candidates. Maximal degree in co-relation 13825. Up to 1524 conditions per place. [2022-07-22 21:20:54,589 INFO L132 encePairwiseOnDemand]: 121/137 looper letters, 39 selfloop transitions, 20 changer transitions 67/215 dead transitions. [2022-07-22 21:20:54,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 215 transitions, 1252 flow [2022-07-22 21:20:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:20:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:20:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1501 transitions. [2022-07-22 21:20:54,595 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8427849522740034 [2022-07-22 21:20:54,595 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1501 transitions. [2022-07-22 21:20:54,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1501 transitions. [2022-07-22 21:20:54,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:54,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1501 transitions. [2022-07-22 21:20:54,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.46153846153847) internal successors, (1501), 13 states have internal predecessors, (1501), 0 states have call successors, (0), 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-22 21:20:54,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:20:54,604 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:20:54,604 INFO L186 Difference]: Start difference. First operand has 162 places, 121 transitions, 360 flow. Second operand 13 states and 1501 transitions. [2022-07-22 21:20:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 215 transitions, 1252 flow [2022-07-22 21:20:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 215 transitions, 1200 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-07-22 21:20:54,635 INFO L242 Difference]: Finished difference. Result has 158 places, 129 transitions, 509 flow [2022-07-22 21:20:54,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=509, PETRI_PLACES=158, PETRI_TRANSITIONS=129} [2022-07-22 21:20:54,637 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 14 predicate places. [2022-07-22 21:20:54,637 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 129 transitions, 509 flow [2022-07-22 21:20:54,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 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-22 21:20:54,638 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:54,638 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] [2022-07-22 21:20:54,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:20:54,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash -763909537, now seen corresponding path program 1 times [2022-07-22 21:20:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:54,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751294799] [2022-07-22 21:20:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:54,779 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-22 21:20:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:54,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751294799] [2022-07-22 21:20:54,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751294799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:54,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:54,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:20:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872779808] [2022-07-22 21:20:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:20:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:20:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:20:54,784 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 137 [2022-07-22 21:20:54,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 129 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-22 21:20:54,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:54,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 137 [2022-07-22 21:20:54,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:55,426 INFO L129 PetriNetUnfolder]: 1014/2349 cut-off events. [2022-07-22 21:20:55,426 INFO L130 PetriNetUnfolder]: For 9614/11182 co-relation queries the response was YES. [2022-07-22 21:20:55,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9384 conditions, 2349 events. 1014/2349 cut-off events. For 9614/11182 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16753 event pairs, 454 based on Foata normal form. 112/2295 useless extension candidates. Maximal degree in co-relation 9295. Up to 988 conditions per place. [2022-07-22 21:20:55,455 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 24 selfloop transitions, 4 changer transitions 25/160 dead transitions. [2022-07-22 21:20:55,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 160 transitions, 830 flow [2022-07-22 21:20:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:20:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:20:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-07-22 21:20:55,459 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8742903487429035 [2022-07-22 21:20:55,459 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-07-22 21:20:55,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-07-22 21:20:55,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:55,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-07-22 21:20:55,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 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-22 21:20:55,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-22 21:20:55,465 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-22 21:20:55,465 INFO L186 Difference]: Start difference. First operand has 158 places, 129 transitions, 509 flow. Second operand 9 states and 1078 transitions. [2022-07-22 21:20:55,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 160 transitions, 830 flow [2022-07-22 21:20:55,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 160 transitions, 776 flow, removed 27 selfloop flow, removed 12 redundant places. [2022-07-22 21:20:55,489 INFO L242 Difference]: Finished difference. Result has 152 places, 129 transitions, 505 flow [2022-07-22 21:20:55,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=152, PETRI_TRANSITIONS=129} [2022-07-22 21:20:55,490 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 8 predicate places. [2022-07-22 21:20:55,490 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 129 transitions, 505 flow [2022-07-22 21:20:55,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-22 21:20:55,491 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:55,491 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-22 21:20:55,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:20:55,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2084961226, now seen corresponding path program 1 times [2022-07-22 21:20:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:55,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525816643] [2022-07-22 21:20:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:55,660 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-22 21:20:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:55,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525816643] [2022-07-22 21:20:55,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525816643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:55,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:55,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:20:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095078242] [2022-07-22 21:20:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:55,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:20:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:20:55,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:20:55,663 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-22 21:20:55,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 129 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 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-22 21:20:55,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:55,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-22 21:20:55,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:58,282 INFO L129 PetriNetUnfolder]: 9034/15718 cut-off events. [2022-07-22 21:20:58,282 INFO L130 PetriNetUnfolder]: For 32212/52290 co-relation queries the response was YES. [2022-07-22 21:20:58,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44734 conditions, 15718 events. 9034/15718 cut-off events. For 32212/52290 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 131938 event pairs, 719 based on Foata normal form. 154/14380 useless extension candidates. Maximal degree in co-relation 44648. Up to 5144 conditions per place. [2022-07-22 21:20:58,436 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 71 selfloop transitions, 18 changer transitions 24/218 dead transitions. [2022-07-22 21:20:58,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 218 transitions, 1188 flow [2022-07-22 21:20:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 21:20:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-22 21:20:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1211 transitions. [2022-07-22 21:20:58,440 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8839416058394161 [2022-07-22 21:20:58,440 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1211 transitions. [2022-07-22 21:20:58,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1211 transitions. [2022-07-22 21:20:58,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:58,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1211 transitions. [2022-07-22 21:20:58,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.1) internal successors, (1211), 10 states have internal predecessors, (1211), 0 states have call successors, (0), 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-22 21:20:58,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-22 21:20:58,446 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 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-22 21:20:58,446 INFO L186 Difference]: Start difference. First operand has 152 places, 129 transitions, 505 flow. Second operand 10 states and 1211 transitions. [2022-07-22 21:20:58,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 218 transitions, 1188 flow [2022-07-22 21:20:58,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 218 transitions, 1168 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-07-22 21:20:58,479 INFO L242 Difference]: Finished difference. Result has 153 places, 145 transitions, 617 flow [2022-07-22 21:20:58,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=617, PETRI_PLACES=153, PETRI_TRANSITIONS=145} [2022-07-22 21:20:58,480 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-07-22 21:20:58,480 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 145 transitions, 617 flow [2022-07-22 21:20:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 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-22 21:20:58,480 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:58,480 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, 1, 1] [2022-07-22 21:20:58,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:20:58,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1063568071, now seen corresponding path program 1 times [2022-07-22 21:20:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:58,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415668293] [2022-07-22 21:20:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:20:58,583 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-22 21:20:58,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:20:58,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415668293] [2022-07-22 21:20:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415668293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:20:58,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:20:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:20:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997195484] [2022-07-22 21:20:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:20:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:20:58,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:20:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:20:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:20:58,586 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-07-22 21:20:58,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 145 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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-22 21:20:58,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:20:58,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-07-22 21:20:58,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:20:59,801 INFO L129 PetriNetUnfolder]: 2289/7447 cut-off events. [2022-07-22 21:20:59,801 INFO L130 PetriNetUnfolder]: For 13165/15421 co-relation queries the response was YES. [2022-07-22 21:20:59,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21995 conditions, 7447 events. 2289/7447 cut-off events. For 13165/15421 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 81692 event pairs, 995 based on Foata normal form. 164/6992 useless extension candidates. Maximal degree in co-relation 21908. Up to 1725 conditions per place. [2022-07-22 21:20:59,882 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 46 selfloop transitions, 15 changer transitions 1/179 dead transitions. [2022-07-22 21:20:59,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 940 flow [2022-07-22 21:20:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:20:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:20:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2022-07-22 21:20:59,885 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8767234387672344 [2022-07-22 21:20:59,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2022-07-22 21:20:59,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2022-07-22 21:20:59,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:20:59,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2022-07-22 21:20:59,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 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-22 21:20:59,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-22 21:20:59,891 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 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-22 21:20:59,892 INFO L186 Difference]: Start difference. First operand has 153 places, 145 transitions, 617 flow. Second operand 9 states and 1081 transitions. [2022-07-22 21:20:59,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 940 flow [2022-07-22 21:20:59,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 179 transitions, 938 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:20:59,942 INFO L242 Difference]: Finished difference. Result has 167 places, 152 transitions, 731 flow [2022-07-22 21:20:59,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=731, PETRI_PLACES=167, PETRI_TRANSITIONS=152} [2022-07-22 21:20:59,945 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 23 predicate places. [2022-07-22 21:20:59,946 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 152 transitions, 731 flow [2022-07-22 21:20:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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-22 21:20:59,946 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:20:59,946 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, 1, 1] [2022-07-22 21:20:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:20:59,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:20:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:20:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -476759429, now seen corresponding path program 1 times [2022-07-22 21:20:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:20:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054272783] [2022-07-22 21:20:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:20:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:20:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:00,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-22 21:21:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054272783] [2022-07-22 21:21:00,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054272783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:00,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:00,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205983931] [2022-07-22 21:21:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:00,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:00,098 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-22 21:21:00,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 152 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 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-22 21:21:00,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:00,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-22 21:21:00,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:02,998 INFO L129 PetriNetUnfolder]: 10686/19967 cut-off events. [2022-07-22 21:21:02,998 INFO L130 PetriNetUnfolder]: For 65089/86898 co-relation queries the response was YES. [2022-07-22 21:21:03,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75587 conditions, 19967 events. 10686/19967 cut-off events. For 65089/86898 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 187810 event pairs, 613 based on Foata normal form. 974/19909 useless extension candidates. Maximal degree in co-relation 75493. Up to 5591 conditions per place. [2022-07-22 21:21:03,186 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 104 selfloop transitions, 36 changer transitions 17/269 dead transitions. [2022-07-22 21:21:03,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 269 transitions, 1875 flow [2022-07-22 21:21:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:21:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:21:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2022-07-22 21:21:03,191 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8848961257720381 [2022-07-22 21:21:03,191 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2022-07-22 21:21:03,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2022-07-22 21:21:03,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:03,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2022-07-22 21:21:03,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 0 states have call successors, (0), 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-22 21:21:03,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:21:03,201 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 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-22 21:21:03,202 INFO L186 Difference]: Start difference. First operand has 167 places, 152 transitions, 731 flow. Second operand 13 states and 1576 transitions. [2022-07-22 21:21:03,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 269 transitions, 1875 flow [2022-07-22 21:21:03,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 269 transitions, 1860 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-07-22 21:21:03,547 INFO L242 Difference]: Finished difference. Result has 184 places, 172 transitions, 1003 flow [2022-07-22 21:21:03,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1003, PETRI_PLACES=184, PETRI_TRANSITIONS=172} [2022-07-22 21:21:03,548 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 40 predicate places. [2022-07-22 21:21:03,548 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 172 transitions, 1003 flow [2022-07-22 21:21:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 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-22 21:21:03,549 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:03,549 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, 1, 1, 1, 1] [2022-07-22 21:21:03,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:21:03,549 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2099991590, now seen corresponding path program 1 times [2022-07-22 21:21:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050415245] [2022-07-22 21:21:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:03,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-22 21:21:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:03,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050415245] [2022-07-22 21:21:03,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050415245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:03,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:03,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380080268] [2022-07-22 21:21:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:03,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:03,693 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-22 21:21:03,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 172 transitions, 1003 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 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-22 21:21:03,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:03,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-22 21:21:03,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:05,272 INFO L129 PetriNetUnfolder]: 3869/13588 cut-off events. [2022-07-22 21:21:05,273 INFO L130 PetriNetUnfolder]: For 47349/53686 co-relation queries the response was YES. [2022-07-22 21:21:05,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50985 conditions, 13588 events. 3869/13588 cut-off events. For 47349/53686 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 180844 event pairs, 568 based on Foata normal form. 184/12761 useless extension candidates. Maximal degree in co-relation 50882. Up to 3973 conditions per place. [2022-07-22 21:21:05,452 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 61 selfloop transitions, 6 changer transitions 8/216 dead transitions. [2022-07-22 21:21:05,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 216 transitions, 1480 flow [2022-07-22 21:21:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:21:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:21:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2022-07-22 21:21:05,456 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.867570385818561 [2022-07-22 21:21:05,456 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2022-07-22 21:21:05,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2022-07-22 21:21:05,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:05,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2022-07-22 21:21:05,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 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-22 21:21:05,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-22 21:21:05,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-22 21:21:05,461 INFO L186 Difference]: Start difference. First operand has 184 places, 172 transitions, 1003 flow. Second operand 7 states and 832 transitions. [2022-07-22 21:21:05,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 216 transitions, 1480 flow [2022-07-22 21:21:07,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 216 transitions, 1387 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-07-22 21:21:07,091 INFO L242 Difference]: Finished difference. Result has 191 places, 177 transitions, 1000 flow [2022-07-22 21:21:07,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=191, PETRI_TRANSITIONS=177} [2022-07-22 21:21:07,092 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 47 predicate places. [2022-07-22 21:21:07,092 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 177 transitions, 1000 flow [2022-07-22 21:21:07,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 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-22 21:21:07,093 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:07,093 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, 1, 1, 1, 1] [2022-07-22 21:21:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:21:07,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -403781802, now seen corresponding path program 2 times [2022-07-22 21:21:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:07,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819276136] [2022-07-22 21:21:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:07,233 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-22 21:21:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:07,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819276136] [2022-07-22 21:21:07,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819276136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:07,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:07,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:21:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710489743] [2022-07-22 21:21:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:07,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:21:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:21:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:21:07,238 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-22 21:21:07,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 177 transitions, 1000 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 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-22 21:21:07,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:07,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-22 21:21:07,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:12,706 INFO L129 PetriNetUnfolder]: 17103/31782 cut-off events. [2022-07-22 21:21:12,707 INFO L130 PetriNetUnfolder]: For 149071/198110 co-relation queries the response was YES. [2022-07-22 21:21:13,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133401 conditions, 31782 events. 17103/31782 cut-off events. For 149071/198110 co-relation queries the response was YES. Maximal size of possible extension queue 2570. Compared 322992 event pairs, 781 based on Foata normal form. 1813/31791 useless extension candidates. Maximal degree in co-relation 133295. Up to 6016 conditions per place. [2022-07-22 21:21:13,040 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 98 selfloop transitions, 54 changer transitions 59/317 dead transitions. [2022-07-22 21:21:13,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 317 transitions, 2546 flow [2022-07-22 21:21:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 21:21:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-22 21:21:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1942 transitions. [2022-07-22 21:21:13,166 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8859489051094891 [2022-07-22 21:21:13,166 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1942 transitions. [2022-07-22 21:21:13,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1942 transitions. [2022-07-22 21:21:13,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:13,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1942 transitions. [2022-07-22 21:21:13,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.375) internal successors, (1942), 16 states have internal predecessors, (1942), 0 states have call successors, (0), 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-22 21:21:13,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-22 21:21:13,193 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 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-22 21:21:13,193 INFO L186 Difference]: Start difference. First operand has 191 places, 177 transitions, 1000 flow. Second operand 16 states and 1942 transitions. [2022-07-22 21:21:13,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 317 transitions, 2546 flow [2022-07-22 21:21:15,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 317 transitions, 2525 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-07-22 21:21:15,211 INFO L242 Difference]: Finished difference. Result has 208 places, 190 transitions, 1296 flow [2022-07-22 21:21:15,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1296, PETRI_PLACES=208, PETRI_TRANSITIONS=190} [2022-07-22 21:21:15,212 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 64 predicate places. [2022-07-22 21:21:15,213 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 190 transitions, 1296 flow [2022-07-22 21:21:15,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 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-22 21:21:15,213 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:15,214 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:15,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:21:15,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 903857004, now seen corresponding path program 1 times [2022-07-22 21:21:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622064696] [2022-07-22 21:21:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:15,401 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-22 21:21:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622064696] [2022-07-22 21:21:15,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622064696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:15,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:15,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 21:21:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981967740] [2022-07-22 21:21:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:21:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:15,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:21:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:21:15,410 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-07-22 21:21:15,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 190 transitions, 1296 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-22 21:21:15,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:15,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-07-22 21:21:15,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:20,636 INFO L129 PetriNetUnfolder]: 16510/31091 cut-off events. [2022-07-22 21:21:20,637 INFO L130 PetriNetUnfolder]: For 187513/236050 co-relation queries the response was YES. [2022-07-22 21:21:20,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143111 conditions, 31091 events. 16510/31091 cut-off events. For 187513/236050 co-relation queries the response was YES. Maximal size of possible extension queue 2568. Compared 321728 event pairs, 764 based on Foata normal form. 1379/30679 useless extension candidates. Maximal degree in co-relation 143066. Up to 5647 conditions per place. [2022-07-22 21:21:20,902 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 71 selfloop transitions, 53 changer transitions 72/302 dead transitions. [2022-07-22 21:21:20,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 302 transitions, 2541 flow [2022-07-22 21:21:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 21:21:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-22 21:21:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2267 transitions. [2022-07-22 21:21:20,908 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8709181713407607 [2022-07-22 21:21:20,908 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2267 transitions. [2022-07-22 21:21:20,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2267 transitions. [2022-07-22 21:21:20,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:20,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2267 transitions. [2022-07-22 21:21:20,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.3157894736842) internal successors, (2267), 19 states have internal predecessors, (2267), 0 states have call successors, (0), 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-22 21:21:20,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-22 21:21:20,920 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 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-22 21:21:20,920 INFO L186 Difference]: Start difference. First operand has 208 places, 190 transitions, 1296 flow. Second operand 19 states and 2267 transitions. [2022-07-22 21:21:20,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 302 transitions, 2541 flow [2022-07-22 21:21:29,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 302 transitions, 2039 flow, removed 197 selfloop flow, removed 22 redundant places. [2022-07-22 21:21:29,846 INFO L242 Difference]: Finished difference. Result has 202 places, 181 transitions, 1018 flow [2022-07-22 21:21:29,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1018, PETRI_PLACES=202, PETRI_TRANSITIONS=181} [2022-07-22 21:21:29,847 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2022-07-22 21:21:29,847 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 181 transitions, 1018 flow [2022-07-22 21:21:29,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 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-22 21:21:29,848 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:29,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:29,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:21:29,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:29,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1594061558, now seen corresponding path program 1 times [2022-07-22 21:21:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:29,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381636585] [2022-07-22 21:21:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:29,972 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-22 21:21:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381636585] [2022-07-22 21:21:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381636585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:29,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:29,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:21:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886899281] [2022-07-22 21:21:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:29,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:21:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:21:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:21:29,976 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-07-22 21:21:29,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 181 transitions, 1018 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:29,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:29,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-07-22 21:21:29,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:31,725 INFO L129 PetriNetUnfolder]: 4632/17166 cut-off events. [2022-07-22 21:21:31,726 INFO L130 PetriNetUnfolder]: For 38304/41186 co-relation queries the response was YES. [2022-07-22 21:21:31,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53370 conditions, 17166 events. 4632/17166 cut-off events. For 38304/41186 co-relation queries the response was YES. Maximal size of possible extension queue 2252. Compared 253951 event pairs, 108 based on Foata normal form. 2/15995 useless extension candidates. Maximal degree in co-relation 53265. Up to 2283 conditions per place. [2022-07-22 21:21:31,970 INFO L132 encePairwiseOnDemand]: 131/137 looper letters, 28 selfloop transitions, 3 changer transitions 5/196 dead transitions. [2022-07-22 21:21:31,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 196 transitions, 1164 flow [2022-07-22 21:21:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:21:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:21:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2022-07-22 21:21:31,972 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8613138686131386 [2022-07-22 21:21:31,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2022-07-22 21:21:31,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2022-07-22 21:21:31,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:31,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2022-07-22 21:21:31,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 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-22 21:21:31,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-22 21:21:31,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 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-22 21:21:31,977 INFO L186 Difference]: Start difference. First operand has 202 places, 181 transitions, 1018 flow. Second operand 7 states and 826 transitions. [2022-07-22 21:21:31,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 196 transitions, 1164 flow [2022-07-22 21:21:33,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 196 transitions, 1013 flow, removed 34 selfloop flow, removed 17 redundant places. [2022-07-22 21:21:33,851 INFO L242 Difference]: Finished difference. Result has 193 places, 182 transitions, 910 flow [2022-07-22 21:21:33,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=910, PETRI_PLACES=193, PETRI_TRANSITIONS=182} [2022-07-22 21:21:33,852 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 49 predicate places. [2022-07-22 21:21:33,853 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 182 transitions, 910 flow [2022-07-22 21:21:33,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:21:33,859 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:33,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:33,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:21:33,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 341026598, now seen corresponding path program 2 times [2022-07-22 21:21:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:33,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607879765] [2022-07-22 21:21:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:21:34,187 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-22 21:21:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:21:34,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607879765] [2022-07-22 21:21:34,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607879765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:21:34,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:21:34,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 21:21:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094069848] [2022-07-22 21:21:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:21:34,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 21:21:34,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:21:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 21:21:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-22 21:21:34,191 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2022-07-22 21:21:34,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 182 transitions, 910 flow. Second operand has 11 states, 11 states have (on average 111.0909090909091) internal successors, (1222), 11 states have internal predecessors, (1222), 0 states have call successors, (0), 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-22 21:21:34,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:21:34,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2022-07-22 21:21:34,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:21:36,543 INFO L129 PetriNetUnfolder]: 5446/19611 cut-off events. [2022-07-22 21:21:36,544 INFO L130 PetriNetUnfolder]: For 30558/32341 co-relation queries the response was YES. [2022-07-22 21:21:36,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54283 conditions, 19611 events. 5446/19611 cut-off events. For 30558/32341 co-relation queries the response was YES. Maximal size of possible extension queue 2556. Compared 294654 event pairs, 100 based on Foata normal form. 9/18248 useless extension candidates. Maximal degree in co-relation 54249. Up to 2529 conditions per place. [2022-07-22 21:21:36,709 INFO L132 encePairwiseOnDemand]: 126/137 looper letters, 17 selfloop transitions, 7 changer transitions 63/190 dead transitions. [2022-07-22 21:21:36,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 190 transitions, 1014 flow [2022-07-22 21:21:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:21:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:21:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1340 transitions. [2022-07-22 21:21:36,713 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8150851581508516 [2022-07-22 21:21:36,713 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1340 transitions. [2022-07-22 21:21:36,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1340 transitions. [2022-07-22 21:21:36,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:21:36,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1340 transitions. [2022-07-22 21:21:36,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 111.66666666666667) internal successors, (1340), 12 states have internal predecessors, (1340), 0 states have call successors, (0), 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-22 21:21:36,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-22 21:21:36,719 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 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-22 21:21:36,719 INFO L186 Difference]: Start difference. First operand has 193 places, 182 transitions, 910 flow. Second operand 12 states and 1340 transitions. [2022-07-22 21:21:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 190 transitions, 1014 flow [2022-07-22 21:21:38,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 190 transitions, 1003 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-22 21:21:38,928 INFO L242 Difference]: Finished difference. Result has 202 places, 127 transitions, 488 flow [2022-07-22 21:21:38,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=488, PETRI_PLACES=202, PETRI_TRANSITIONS=127} [2022-07-22 21:21:38,929 INFO L279 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2022-07-22 21:21:38,929 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 127 transitions, 488 flow [2022-07-22 21:21:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.0909090909091) internal successors, (1222), 11 states have internal predecessors, (1222), 0 states have call successors, (0), 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-22 21:21:38,930 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:21:38,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:38,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:21:38,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-22 21:21:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:21:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash 237497246, now seen corresponding path program 3 times [2022-07-22 21:21:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:21:38,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061774284] [2022-07-22 21:21:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:21:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:21:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:21:38,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 21:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 21:21:39,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 21:21:39,097 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 21:21:39,097 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-22 21:21:39,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-22 21:21:39,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-22 21:21:39,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-22 21:21:39,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-22 21:21:39,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-22 21:21:39,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-22 21:21:39,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 21:21:39,101 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:21:39,106 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:21:39,106 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:21:39,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:21:39 BasicIcfg [2022-07-22 21:21:39,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:21:39,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:21:39,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:21:39,304 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:21:39,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:20:50" (3/4) ... [2022-07-22 21:21:39,306 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 21:21:39,464 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:21:39,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:21:39,465 INFO L158 Benchmark]: Toolchain (without parser) took 50693.55ms. Allocated memory was 88.1MB in the beginning and 9.1GB in the end (delta: 9.1GB). Free memory was 65.2MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-07-22 21:21:39,465 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:21:39,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.61ms. Allocated memory is still 88.1MB. Free memory was 65.0MB in the beginning and 41.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-22 21:21:39,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.96ms. Allocated memory is still 88.1MB. Free memory was 41.0MB in the beginning and 37.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:21:39,466 INFO L158 Benchmark]: Boogie Preprocessor took 45.87ms. Allocated memory was 88.1MB in the beginning and 138.4MB in the end (delta: 50.3MB). Free memory was 37.8MB in the beginning and 113.0MB in the end (delta: -75.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 21:21:39,466 INFO L158 Benchmark]: RCFGBuilder took 1126.74ms. Allocated memory is still 138.4MB. Free memory was 113.0MB in the beginning and 62.2MB in the end (delta: 50.7MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2022-07-22 21:21:39,467 INFO L158 Benchmark]: TraceAbstraction took 48867.46ms. Allocated memory was 138.4MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 62.2MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-07-22 21:21:39,467 INFO L158 Benchmark]: Witness Printer took 160.75ms. Allocated memory is still 9.1GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-07-22 21:21:39,470 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.12ms. Allocated memory is still 88.1MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.61ms. Allocated memory is still 88.1MB. Free memory was 65.0MB in the beginning and 41.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.96ms. Allocated memory is still 88.1MB. Free memory was 41.0MB in the beginning and 37.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.87ms. Allocated memory was 88.1MB in the beginning and 138.4MB in the end (delta: 50.3MB). Free memory was 37.8MB in the beginning and 113.0MB in the end (delta: -75.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.74ms. Allocated memory is still 138.4MB. Free memory was 113.0MB in the beginning and 62.2MB in the end (delta: 50.7MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48867.46ms. Allocated memory was 138.4MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 62.2MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 160.75ms. Allocated memory is still 9.1GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L869] 0 pthread_t t125; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t125={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t125, ((void *)0), P0, ((void *)0))=8, t125={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L871] 0 pthread_t t126; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t126, ((void *)0), P1, ((void *)0))=9, t125={5:0}, t126={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L873] 0 pthread_t t127; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t127, ((void *)0), P2, ((void *)0))=10, t125={5:0}, t126={6:0}, t127={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L875] 0 pthread_t t128; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L876] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t128, ((void *)0), P3, ((void *)0))=11, t125={5:0}, t126={6:0}, t127={7:0}, t128={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 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) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] 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) [L882] 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) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 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 [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 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 [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 876]: 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: 874]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 45.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 750 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1204 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1595 IncrementalHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 138 mSDtfsCounter, 1595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1296occurred in iteration=9, InterpolantAutomatonStates: 131, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1130 ConstructedInterpolants, 0 QuantifiedInterpolants, 4779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-22 21:21:39,518 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