./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix023_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix023_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:36:21,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:36:21,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:36:21,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:36:21,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:36:21,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:36:21,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:36:21,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:36:21,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:36:21,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:36:21,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:36:21,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:36:21,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:36:21,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:36:21,688 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:36:21,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:36:21,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:36:21,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:36:21,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:36:21,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:36:21,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:36:21,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:36:21,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:36:21,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:36:21,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:36:21,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:36:21,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:36:21,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:36:21,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:36:21,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:36:21,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:36:21,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:36:21,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:36:21,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:36:21,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:36:21,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:36:21,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:36:21,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:36:21,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:36:21,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:36:21,695 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:36:21,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:36:21,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:36:21,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:36:21,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:36:21,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:36:21,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:36:21,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:36:21,929 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:36:21,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-01-31 17:36:23,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:36:23,285 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:36:23,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-01-31 17:36:23,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fc3f413/d68eaeaa4cfa45c3b0fa6b0d80b9066e/FLAG509c5f862 [2024-01-31 17:36:23,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40fc3f413/d68eaeaa4cfa45c3b0fa6b0d80b9066e [2024-01-31 17:36:23,317 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:36:23,318 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:36:23,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix023_tso.yml/witness.yml [2024-01-31 17:36:24,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:36:24,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:36:24,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:36:24,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:36:24,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:36:24,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:36:23" (1/2) ... [2024-01-31 17:36:24,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3be6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:24, skipping insertion in model container [2024-01-31 17:36:24,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:36:23" (1/2) ... [2024-01-31 17:36:24,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2eb1780b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:24, skipping insertion in model container [2024-01-31 17:36:24,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:24" (2/2) ... [2024-01-31 17:36:24,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3be6f9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:24, skipping insertion in model container [2024-01-31 17:36:24,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:24" (2/2) ... [2024-01-31 17:36:24,532 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:36:31,264 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:36:31,265 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:36:31,265 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:36:31,301 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:36:31,435 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] [2024-01-31 17:36:31,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:31,591 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:36:31,599 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i[944,957] Start Parsing Local [2024-01-31 17:36:31,631 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:36:31,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:31,743 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:36:31,744 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31 WrapperNode [2024-01-31 17:36:31,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:36:31,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:31,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:36:31,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:36:31,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,816 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 284 [2024-01-31 17:36:31,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:31,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:36:31,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:36:31,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:36:31,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,861 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:36:31,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:36:31,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:36:31,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:36:31,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:36:31,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (1/1) ... [2024-01-31 17:36:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:36:31,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:36:31,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:36:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:36:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:36:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:36:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:36:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:36:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:36:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:36:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:36:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:36:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:36:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:36:32,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:36:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:36:32,015 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:36:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:36:32,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:36:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:36:32,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:36:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:36:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:36:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:36:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:36:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:36:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:36:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:36:32,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:36:32,019 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:36:32,141 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:36:32,142 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:36:32,485 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:36:32,485 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:36:32,669 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:36:32,670 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:36:32,670 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:32 BoogieIcfgContainer [2024-01-31 17:36:32,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:36:32,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:36:32,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:36:32,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:36:32,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:36:23" (1/4) ... [2024-01-31 17:36:32,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743367de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:24" (2/4) ... [2024-01-31 17:36:32,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743367de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:31" (3/4) ... [2024-01-31 17:36:32,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743367de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:32" (4/4) ... [2024-01-31 17:36:32,677 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2024-01-31 17:36:32,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:36:32,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-01-31 17:36:32,692 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:36:32,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:36:32,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 55 transitions, 126 flow [2024-01-31 17:36:32,814 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2024-01-31 17:36:32,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 1/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-01-31 17:36:32,818 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 55 transitions, 126 flow [2024-01-31 17:36:32,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 51 transitions, 114 flow [2024-01-31 17:36:32,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:36:32,831 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f9b477b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:36:32,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-01-31 17:36:32,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:36:32,835 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-01-31 17:36:32,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:32,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:32,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:36:32,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:32,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1256525630, now seen corresponding path program 1 times [2024-01-31 17:36:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:32,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281740332] [2024-01-31 17:36:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281740332] [2024-01-31 17:36:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281740332] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886363367] [2024-01-31 17:36:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:33,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:36:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:36:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:36:33,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-31 17:36:33,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:33,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:33,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-31 17:36:33,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:34,942 INFO L124 PetriNetUnfolderBase]: 6773/11443 cut-off events. [2024-01-31 17:36:34,943 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-01-31 17:36:34,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20793 conditions, 11443 events. 6773/11443 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 93742 event pairs, 6773 based on Foata normal form. 324/10213 useless extension candidates. Maximal degree in co-relation 20781. Up to 9193 conditions per place. [2024-01-31 17:36:35,009 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2024-01-31 17:36:35,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 164 flow [2024-01-31 17:36:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:36:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:36:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2024-01-31 17:36:35,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7181818181818181 [2024-01-31 17:36:35,019 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 114 flow. Second operand 2 states and 79 transitions. [2024-01-31 17:36:35,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 164 flow [2024-01-31 17:36:35,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:36:35,024 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 104 flow [2024-01-31 17:36:35,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-01-31 17:36:35,028 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2024-01-31 17:36:35,028 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 104 flow [2024-01-31 17:36:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:35,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:35,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:36:35,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:36:35,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:35,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1256525631, now seen corresponding path program 1 times [2024-01-31 17:36:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:35,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706196064] [2024-01-31 17:36:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706196064] [2024-01-31 17:36:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706196064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:35,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030131667] [2024-01-31 17:36:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:35,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:35,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:35,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-31 17:36:35,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:35,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:35,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-31 17:36:35,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:36,134 INFO L124 PetriNetUnfolderBase]: 5578/8784 cut-off events. [2024-01-31 17:36:36,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:36,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16510 conditions, 8784 events. 5578/8784 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 61686 event pairs, 1590 based on Foata normal form. 0/8322 useless extension candidates. Maximal degree in co-relation 16507. Up to 6389 conditions per place. [2024-01-31 17:36:36,184 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 44 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-01-31 17:36:36,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 236 flow [2024-01-31 17:36:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-01-31 17:36:36,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2024-01-31 17:36:36,186 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 104 flow. Second operand 3 states and 119 transitions. [2024-01-31 17:36:36,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 236 flow [2024-01-31 17:36:36,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:36:36,188 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 106 flow [2024-01-31 17:36:36,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-01-31 17:36:36,189 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2024-01-31 17:36:36,189 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 106 flow [2024-01-31 17:36:36,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:36,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:36,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:36:36,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:36,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash -873348196, now seen corresponding path program 1 times [2024-01-31 17:36:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551583662] [2024-01-31 17:36:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:36,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551583662] [2024-01-31 17:36:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551583662] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110334674] [2024-01-31 17:36:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:36,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:36,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-31 17:36:36,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:36,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-31 17:36:36,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:37,211 INFO L124 PetriNetUnfolderBase]: 4636/7362 cut-off events. [2024-01-31 17:36:37,212 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2024-01-31 17:36:37,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14172 conditions, 7362 events. 4636/7362 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 52256 event pairs, 868 based on Foata normal form. 0/7212 useless extension candidates. Maximal degree in co-relation 14168. Up to 5029 conditions per place. [2024-01-31 17:36:37,255 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 36 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-01-31 17:36:37,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 214 flow [2024-01-31 17:36:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-01-31 17:36:37,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2024-01-31 17:36:37,257 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 113 transitions. [2024-01-31 17:36:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 214 flow [2024-01-31 17:36:37,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:37,259 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 102 flow [2024-01-31 17:36:37,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-01-31 17:36:37,260 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2024-01-31 17:36:37,260 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 102 flow [2024-01-31 17:36:37,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:37,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:37,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:37,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:36:37,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:37,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1405405348, now seen corresponding path program 1 times [2024-01-31 17:36:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340918399] [2024-01-31 17:36:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:37,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340918399] [2024-01-31 17:36:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340918399] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:37,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:36:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731054850] [2024-01-31 17:36:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:37,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:37,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:37,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-01-31 17:36:37,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:37,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:37,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-01-31 17:36:37,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:38,335 INFO L124 PetriNetUnfolderBase]: 5956/8817 cut-off events. [2024-01-31 17:36:38,336 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2024-01-31 17:36:38,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 8817 events. 5956/8817 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 59884 event pairs, 4636 based on Foata normal form. 0/8487 useless extension candidates. Maximal degree in co-relation 17459. Up to 6339 conditions per place. [2024-01-31 17:36:38,375 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 38 selfloop transitions, 1 changer transitions 1/56 dead transitions. [2024-01-31 17:36:38,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 206 flow [2024-01-31 17:36:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-01-31 17:36:38,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2024-01-31 17:36:38,380 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 102 flow. Second operand 3 states and 101 transitions. [2024-01-31 17:36:38,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 206 flow [2024-01-31 17:36:38,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:38,386 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 96 flow [2024-01-31 17:36:38,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-01-31 17:36:38,387 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2024-01-31 17:36:38,387 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 96 flow [2024-01-31 17:36:38,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:38,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:38,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:38,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:36:38,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:38,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash -617892186, now seen corresponding path program 1 times [2024-01-31 17:36:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122327381] [2024-01-31 17:36:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122327381] [2024-01-31 17:36:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122327381] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077718290] [2024-01-31 17:36:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:45,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:45,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:36:45,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:45,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:45,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:36:45,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:46,820 INFO L124 PetriNetUnfolderBase]: 8105/11785 cut-off events. [2024-01-31 17:36:46,820 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2024-01-31 17:36:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23221 conditions, 11785 events. 8105/11785 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 80998 event pairs, 1777 based on Foata normal form. 324/12067 useless extension candidates. Maximal degree in co-relation 23217. Up to 7073 conditions per place. [2024-01-31 17:36:46,976 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 43 selfloop transitions, 2 changer transitions 49/108 dead transitions. [2024-01-31 17:36:46,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 418 flow [2024-01-31 17:36:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:36:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:36:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-01-31 17:36:46,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5766233766233766 [2024-01-31 17:36:46,983 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 96 flow. Second operand 7 states and 222 transitions. [2024-01-31 17:36:46,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 418 flow [2024-01-31 17:36:47,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:36:47,004 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 111 flow [2024-01-31 17:36:47,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-01-31 17:36:47,006 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-01-31 17:36:47,006 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 111 flow [2024-01-31 17:36:47,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:47,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:47,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:47,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:36:47,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:47,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 499562523, now seen corresponding path program 1 times [2024-01-31 17:36:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216689239] [2024-01-31 17:36:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:53,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216689239] [2024-01-31 17:36:53,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216689239] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:53,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:53,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096967797] [2024-01-31 17:36:53,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:53,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:53,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:53,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:53,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:36:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:53,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:36:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:54,265 INFO L124 PetriNetUnfolderBase]: 6605/9700 cut-off events. [2024-01-31 17:36:54,266 INFO L125 PetriNetUnfolderBase]: For 1677/1677 co-relation queries the response was YES. [2024-01-31 17:36:54,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20770 conditions, 9700 events. 6605/9700 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 64603 event pairs, 1769 based on Foata normal form. 216/9841 useless extension candidates. Maximal degree in co-relation 20761. Up to 5593 conditions per place. [2024-01-31 17:36:54,315 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 41/96 dead transitions. [2024-01-31 17:36:54,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 394 flow [2024-01-31 17:36:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:36:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:36:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-01-31 17:36:54,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-01-31 17:36:54,317 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 111 flow. Second operand 7 states and 210 transitions. [2024-01-31 17:36:54,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 394 flow [2024-01-31 17:36:54,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 372 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-31 17:36:54,364 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 115 flow [2024-01-31 17:36:54,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-01-31 17:36:54,366 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-01-31 17:36:54,366 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 115 flow [2024-01-31 17:36:54,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:54,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:54,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:54,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:36:54,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:54,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1123870905, now seen corresponding path program 1 times [2024-01-31 17:36:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:54,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905567801] [2024-01-31 17:36:54,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905567801] [2024-01-31 17:36:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905567801] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:36:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942822413] [2024-01-31 17:36:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:54,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:36:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:36:54,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:36:54,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-01-31 17:36:54,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:54,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:54,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-01-31 17:36:54,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:55,850 INFO L124 PetriNetUnfolderBase]: 11027/15833 cut-off events. [2024-01-31 17:36:55,851 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2024-01-31 17:36:55,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34418 conditions, 15833 events. 11027/15833 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 102584 event pairs, 1419 based on Foata normal form. 576/16351 useless extension candidates. Maximal degree in co-relation 34408. Up to 8129 conditions per place. [2024-01-31 17:36:55,946 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 6 changer transitions 1/79 dead transitions. [2024-01-31 17:36:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 333 flow [2024-01-31 17:36:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:36:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:36:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-01-31 17:36:55,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-01-31 17:36:55,948 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 115 flow. Second operand 4 states and 144 transitions. [2024-01-31 17:36:55,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 333 flow [2024-01-31 17:36:55,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 317 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-01-31 17:36:55,999 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 145 flow [2024-01-31 17:36:55,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2024-01-31 17:36:55,999 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2024-01-31 17:36:55,999 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 145 flow [2024-01-31 17:36:56,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:56,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:56,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:36:56,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:56,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1052507147, now seen corresponding path program 1 times [2024-01-31 17:36:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546729735] [2024-01-31 17:36:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:56,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546729735] [2024-01-31 17:36:56,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546729735] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:56,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:56,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:36:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062609193] [2024-01-31 17:36:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:56,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:36:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:36:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:36:56,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-01-31 17:36:56,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:56,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:56,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-01-31 17:36:56,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:57,430 INFO L124 PetriNetUnfolderBase]: 8499/12329 cut-off events. [2024-01-31 17:36:57,430 INFO L125 PetriNetUnfolderBase]: For 3256/3256 co-relation queries the response was YES. [2024-01-31 17:36:57,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29852 conditions, 12329 events. 8499/12329 cut-off events. For 3256/3256 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 76517 event pairs, 655 based on Foata normal form. 512/12790 useless extension candidates. Maximal degree in co-relation 29844. Up to 4961 conditions per place. [2024-01-31 17:36:57,491 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 76 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2024-01-31 17:36:57,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 460 flow [2024-01-31 17:36:57,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:36:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:36:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2024-01-31 17:36:57,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2024-01-31 17:36:57,493 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 145 flow. Second operand 5 states and 184 transitions. [2024-01-31 17:36:57,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 460 flow [2024-01-31 17:36:57,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 449 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:57,497 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 197 flow [2024-01-31 17:36:57,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2024-01-31 17:36:57,498 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-01-31 17:36:57,498 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 197 flow [2024-01-31 17:36:57,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:57,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:57,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:57,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:36:57,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:57,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1529754192, now seen corresponding path program 1 times [2024-01-31 17:36:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322746442] [2024-01-31 17:36:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:57,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322746442] [2024-01-31 17:36:57,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322746442] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:57,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975492563] [2024-01-31 17:36:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:57,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-01-31 17:36:57,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:57,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:57,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-01-31 17:36:57,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:58,565 INFO L124 PetriNetUnfolderBase]: 5587/8121 cut-off events. [2024-01-31 17:36:58,565 INFO L125 PetriNetUnfolderBase]: For 6209/6209 co-relation queries the response was YES. [2024-01-31 17:36:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21580 conditions, 8121 events. 5587/8121 cut-off events. For 6209/6209 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 46279 event pairs, 463 based on Foata normal form. 320/8390 useless extension candidates. Maximal degree in co-relation 21571. Up to 2528 conditions per place. [2024-01-31 17:36:58,637 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 91 selfloop transitions, 14 changer transitions 1/119 dead transitions. [2024-01-31 17:36:58,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 601 flow [2024-01-31 17:36:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:36:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:36:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-01-31 17:36:58,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-01-31 17:36:58,639 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 197 flow. Second operand 6 states and 222 transitions. [2024-01-31 17:36:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 601 flow [2024-01-31 17:36:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 571 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-31 17:36:58,705 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 247 flow [2024-01-31 17:36:58,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2024-01-31 17:36:58,706 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2024-01-31 17:36:58,706 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 247 flow [2024-01-31 17:36:58,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:58,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:58,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:58,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:36:58,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:36:58,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2115305774, now seen corresponding path program 1 times [2024-01-31 17:36:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877948655] [2024-01-31 17:36:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:59,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877948655] [2024-01-31 17:36:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877948655] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:59,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:59,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:36:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987833659] [2024-01-31 17:36:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:59,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:59,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:59,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:36:59,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:59,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:59,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:36:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:00,042 INFO L124 PetriNetUnfolderBase]: 6367/10007 cut-off events. [2024-01-31 17:37:00,043 INFO L125 PetriNetUnfolderBase]: For 5376/6076 co-relation queries the response was YES. [2024-01-31 17:37:00,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24191 conditions, 10007 events. 6367/10007 cut-off events. For 5376/6076 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 66589 event pairs, 1624 based on Foata normal form. 210/9812 useless extension candidates. Maximal degree in co-relation 24181. Up to 5014 conditions per place. [2024-01-31 17:37:00,098 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 65 selfloop transitions, 2 changer transitions 20/113 dead transitions. [2024-01-31 17:37:00,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 572 flow [2024-01-31 17:37:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:37:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:37:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-01-31 17:37:00,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2024-01-31 17:37:00,100 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 247 flow. Second operand 6 states and 196 transitions. [2024-01-31 17:37:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 572 flow [2024-01-31 17:37:00,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 525 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-01-31 17:37:00,131 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 221 flow [2024-01-31 17:37:00,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-01-31 17:37:00,132 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2024-01-31 17:37:00,132 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 221 flow [2024-01-31 17:37:00,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:00,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:00,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:00,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:37:00,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:00,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -790134514, now seen corresponding path program 2 times [2024-01-31 17:37:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239092949] [2024-01-31 17:37:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:01,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:01,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239092949] [2024-01-31 17:37:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239092949] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-01-31 17:37:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746579288] [2024-01-31 17:37:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-31 17:37:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-31 17:37:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-01-31 17:37:01,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:37:01,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 221 flow. Second operand has 13 states, 13 states have (on average 19.76923076923077) internal successors, (257), 13 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:01,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:01,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:37:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:04,124 INFO L124 PetriNetUnfolderBase]: 13197/20873 cut-off events. [2024-01-31 17:37:04,124 INFO L125 PetriNetUnfolderBase]: For 6870/7552 co-relation queries the response was YES. [2024-01-31 17:37:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48950 conditions, 20873 events. 13197/20873 cut-off events. For 6870/7552 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 153250 event pairs, 4121 based on Foata normal form. 407/20366 useless extension candidates. Maximal degree in co-relation 48937. Up to 8560 conditions per place. [2024-01-31 17:37:04,211 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 109 selfloop transitions, 18 changer transitions 18/172 dead transitions. [2024-01-31 17:37:04,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 172 transitions, 812 flow [2024-01-31 17:37:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-31 17:37:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-31 17:37:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 344 transitions. [2024-01-31 17:37:04,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5685950413223141 [2024-01-31 17:37:04,214 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 221 flow. Second operand 11 states and 344 transitions. [2024-01-31 17:37:04,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 172 transitions, 812 flow [2024-01-31 17:37:04,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 172 transitions, 797 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-31 17:37:04,309 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 330 flow [2024-01-31 17:37:04,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=330, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-01-31 17:37:04,313 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 21 predicate places. [2024-01-31 17:37:04,313 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 330 flow [2024-01-31 17:37:04,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.76923076923077) internal successors, (257), 13 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:04,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:04,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:04,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:37:04,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:04,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash 287929724, now seen corresponding path program 3 times [2024-01-31 17:37:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575854336] [2024-01-31 17:37:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575854336] [2024-01-31 17:37:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575854336] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:05,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-31 17:37:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83704826] [2024-01-31 17:37:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:05,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:37:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:05,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:37:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:37:05,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-01-31 17:37:05,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 330 flow. Second operand has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:05,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:05,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-01-31 17:37:05,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:09,120 INFO L124 PetriNetUnfolderBase]: 19729/31286 cut-off events. [2024-01-31 17:37:09,120 INFO L125 PetriNetUnfolderBase]: For 24160/25491 co-relation queries the response was YES. [2024-01-31 17:37:09,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83124 conditions, 31286 events. 19729/31286 cut-off events. For 24160/25491 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 248959 event pairs, 6632 based on Foata normal form. 633/30515 useless extension candidates. Maximal degree in co-relation 83106. Up to 8368 conditions per place. [2024-01-31 17:37:09,320 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 120 selfloop transitions, 33 changer transitions 28/209 dead transitions. [2024-01-31 17:37:09,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 209 transitions, 1187 flow [2024-01-31 17:37:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-31 17:37:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-31 17:37:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 394 transitions. [2024-01-31 17:37:09,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5969696969696969 [2024-01-31 17:37:09,323 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 330 flow. Second operand 12 states and 394 transitions. [2024-01-31 17:37:09,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 209 transitions, 1187 flow [2024-01-31 17:37:09,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 209 transitions, 1163 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-01-31 17:37:09,506 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 603 flow [2024-01-31 17:37:09,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=603, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2024-01-31 17:37:09,507 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 37 predicate places. [2024-01-31 17:37:09,508 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 603 flow [2024-01-31 17:37:09,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.916666666666668) internal successors, (251), 12 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:09,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:09,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:09,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:37:09,510 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:09,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -236275828, now seen corresponding path program 4 times [2024-01-31 17:37:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848325977] [2024-01-31 17:37:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848325977] [2024-01-31 17:37:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848325977] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:09,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:09,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:37:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812659582] [2024-01-31 17:37:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:09,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:37:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:37:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:37:09,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-01-31 17:37:09,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:09,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:09,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-01-31 17:37:09,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:13,635 INFO L124 PetriNetUnfolderBase]: 24875/35045 cut-off events. [2024-01-31 17:37:13,636 INFO L125 PetriNetUnfolderBase]: For 77118/77851 co-relation queries the response was YES. [2024-01-31 17:37:13,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121709 conditions, 35045 events. 24875/35045 cut-off events. For 77118/77851 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 231540 event pairs, 1322 based on Foata normal form. 1304/35575 useless extension candidates. Maximal degree in co-relation 121683. Up to 11396 conditions per place. [2024-01-31 17:37:13,893 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 117 selfloop transitions, 18 changer transitions 32/186 dead transitions. [2024-01-31 17:37:13,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 186 transitions, 1426 flow [2024-01-31 17:37:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-01-31 17:37:13,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6077922077922078 [2024-01-31 17:37:13,895 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 603 flow. Second operand 7 states and 234 transitions. [2024-01-31 17:37:13,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 186 transitions, 1426 flow [2024-01-31 17:37:14,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 186 transitions, 1324 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-01-31 17:37:14,665 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 534 flow [2024-01-31 17:37:14,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2024-01-31 17:37:14,666 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 35 predicate places. [2024-01-31 17:37:14,666 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 534 flow [2024-01-31 17:37:14,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:14,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:14,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:14,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:37:14,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:14,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1033791001, now seen corresponding path program 1 times [2024-01-31 17:37:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:14,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703112837] [2024-01-31 17:37:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703112837] [2024-01-31 17:37:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703112837] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:37:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126202864] [2024-01-31 17:37:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:14,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:37:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:14,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:37:14,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:37:14,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:37:14,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:14,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:14,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:37:14,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:17,188 INFO L124 PetriNetUnfolderBase]: 14501/23116 cut-off events. [2024-01-31 17:37:17,188 INFO L125 PetriNetUnfolderBase]: For 39419/40479 co-relation queries the response was YES. [2024-01-31 17:37:17,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71392 conditions, 23116 events. 14501/23116 cut-off events. For 39419/40479 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 182257 event pairs, 2434 based on Foata normal form. 108/21678 useless extension candidates. Maximal degree in co-relation 71369. Up to 10705 conditions per place. [2024-01-31 17:37:17,443 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 97 selfloop transitions, 2 changer transitions 12/143 dead transitions. [2024-01-31 17:37:17,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 1028 flow [2024-01-31 17:37:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:37:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:37:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-01-31 17:37:17,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2024-01-31 17:37:17,445 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 534 flow. Second operand 6 states and 177 transitions. [2024-01-31 17:37:17,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 1028 flow [2024-01-31 17:37:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 143 transitions, 883 flow, removed 28 selfloop flow, removed 13 redundant places. [2024-01-31 17:37:17,956 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 432 flow [2024-01-31 17:37:17,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-01-31 17:37:17,956 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 29 predicate places. [2024-01-31 17:37:17,957 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 432 flow [2024-01-31 17:37:17,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:17,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:17,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:17,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:37:17,958 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:17,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1099732683, now seen corresponding path program 2 times [2024-01-31 17:37:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325179155] [2024-01-31 17:37:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325179155] [2024-01-31 17:37:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325179155] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-01-31 17:37:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197238048] [2024-01-31 17:37:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:19,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-31 17:37:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-31 17:37:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-01-31 17:37:19,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2024-01-31 17:37:19,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 432 flow. Second operand has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:19,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:19,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2024-01-31 17:37:19,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:26,532 INFO L124 PetriNetUnfolderBase]: 37714/59973 cut-off events. [2024-01-31 17:37:26,533 INFO L125 PetriNetUnfolderBase]: For 63217/63319 co-relation queries the response was YES. [2024-01-31 17:37:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159348 conditions, 59973 events. 37714/59973 cut-off events. For 63217/63319 co-relation queries the response was YES. Maximal size of possible extension queue 4110. Compared 532367 event pairs, 6978 based on Foata normal form. 42/56526 useless extension candidates. Maximal degree in co-relation 159329. Up to 17110 conditions per place. [2024-01-31 17:37:27,108 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 110 selfloop transitions, 44 changer transitions 156/338 dead transitions. [2024-01-31 17:37:27,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 338 transitions, 2268 flow [2024-01-31 17:37:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-31 17:37:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-31 17:37:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 517 transitions. [2024-01-31 17:37:27,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-01-31 17:37:27,112 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 432 flow. Second operand 18 states and 517 transitions. [2024-01-31 17:37:27,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 338 transitions, 2268 flow [2024-01-31 17:37:27,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 338 transitions, 2257 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-31 17:37:27,231 INFO L231 Difference]: Finished difference. Result has 115 places, 117 transitions, 833 flow [2024-01-31 17:37:27,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=833, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2024-01-31 17:37:27,246 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 52 predicate places. [2024-01-31 17:37:27,246 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 833 flow [2024-01-31 17:37:27,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:37:27,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:27,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:37:27,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-01-31 17:37:27,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1270231267, now seen corresponding path program 3 times [2024-01-31 17:37:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890824913] [2024-01-31 17:37:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:37:27,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:37:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:37:27,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:37:27,485 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:37:27,486 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (13 of 14 remaining) [2024-01-31 17:37:27,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (11 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (9 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 14 remaining) [2024-01-31 17:37:27,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 14 remaining) [2024-01-31 17:37:27,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2024-01-31 17:37:27,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 14 remaining) [2024-01-31 17:37:27,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 14 remaining) [2024-01-31 17:37:27,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 14 remaining) [2024-01-31 17:37:27,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 14 remaining) [2024-01-31 17:37:27,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 17:37:27,490 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:27,495 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:37:27,495 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:37:27,598 INFO L503 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-01-31 17:37:27,598 INFO L504 ceAbstractionStarter]: WitnessConsidered=3 [2024-01-31 17:37:27,598 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:37:27 BasicIcfg [2024-01-31 17:37:27,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:37:27,599 INFO L158 Benchmark]: Toolchain (without parser) took 63077.90ms. Allocated memory was 448.8MB in the beginning and 5.5GB in the end (delta: 5.0GB). Free memory was 254.8MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 699.4MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,599 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:37:27,599 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:37:27,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 7221.28ms. Allocated memory was 448.8MB in the beginning and 641.7MB in the end (delta: 192.9MB). Free memory was 254.8MB in the beginning and 260.2MB in the end (delta: -5.4MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.24ms. Allocated memory is still 641.7MB. Free memory was 260.2MB in the beginning and 256.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,600 INFO L158 Benchmark]: Boogie Preprocessor took 80.99ms. Allocated memory is still 641.7MB. Free memory was 256.0MB in the beginning and 249.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,600 INFO L158 Benchmark]: RCFGBuilder took 771.21ms. Allocated memory is still 641.7MB. Free memory was 249.7MB in the beginning and 143.8MB in the end (delta: 105.9MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,600 INFO L158 Benchmark]: TraceAbstraction took 54926.93ms. Allocated memory was 641.7MB in the beginning and 5.5GB in the end (delta: 4.8GB). Free memory was 142.8MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 393.4MB. Max. memory is 16.1GB. [2024-01-31 17:37:27,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 132.1MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 7221.28ms. Allocated memory was 448.8MB in the beginning and 641.7MB in the end (delta: 192.9MB). Free memory was 254.8MB in the beginning and 260.2MB in the end (delta: -5.4MB). Peak memory consumption was 314.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.24ms. Allocated memory is still 641.7MB. Free memory was 260.2MB in the beginning and 256.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.99ms. Allocated memory is still 641.7MB. Free memory was 256.0MB in the beginning and 249.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 771.21ms. Allocated memory is still 641.7MB. Free memory was 249.7MB in the beginning and 143.8MB in the end (delta: 105.9MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * TraceAbstraction took 54926.93ms. Allocated memory was 641.7MB in the beginning and 5.5GB in the end (delta: 4.8GB). Free memory was 142.8MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 393.4MB. 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; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t625={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t625={6:0}, t626={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L924] 0 pthread_t t627; [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, t625={6:0}, t626={7:0}, t627={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, t625={6:0}, t626={7:0}, t627={8:0}, t628={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=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=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, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=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=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, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=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=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, z=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 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) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 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) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 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 [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={6:0}, t626={7:0}, t627={8:0}, t628={5:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 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) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 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 [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={6:0}, t626={7:0}, t627={8:0}, t628={5:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={6:0}, t626={7:0}, t627={8:0}, t628={5:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 925]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 927]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 921]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 93 locations, 14 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: 54.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1447 mSDsluCounter, 670 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 606 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2973 IncrementalHoareTripleChecker+Invalid, 3225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 64 mSDtfsCounter, 2973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=833occurred in iteration=15, InterpolantAutomatonStates: 100, 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, 19.6s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 4783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2024-01-31 17:37:27,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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