./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.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/safe019_power.opt.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/safe019_power.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/safe019_power.opt.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:41:11,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:41:11,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:41:11,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:41:11,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:41:11,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:41:11,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:41:11,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:41:11,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:41:11,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:41:11,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:41:11,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:41:11,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:41:11,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:41:11,251 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:41:11,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:41:11,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:41:11,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:41:11,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:41:11,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:41:11,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:41:11,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:41:11,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:41:11,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:41:11,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:41:11,253 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:41:11,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:41:11,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:41:11,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:41:11,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:41:11,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:41:11,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:41:11,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:41:11,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:41:11,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:41:11,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:41:11,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:41:11,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:41:11,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:41:11,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:41:11,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:41:11,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:41:11,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:41:11,258 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:41:11,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:41:11,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:41:11,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:41:11,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:41:11,463 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:41:11,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2024-01-31 17:41:12,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:41:12,688 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:41:12,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2024-01-31 17:41:12,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6224aa925/8acee60d09a44f189b23de48b873f5e6/FLAGea476b463 [2024-01-31 17:41:12,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6224aa925/8acee60d09a44f189b23de48b873f5e6 [2024-01-31 17:41:12,712 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:41:12,712 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:41:12,712 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/safe019_power.opt.yml/witness.yml [2024-01-31 17:41:13,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:41:13,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:41:13,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:41:13,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:41:13,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:41:13,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:41:12" (1/2) ... [2024-01-31 17:41:13,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54defb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:41:13, skipping insertion in model container [2024-01-31 17:41:13,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:41:12" (1/2) ... [2024-01-31 17:41:13,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@753a67bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:41:13, skipping insertion in model container [2024-01-31 17:41:13,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:13" (2/2) ... [2024-01-31 17:41:13,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54defb9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:13, skipping insertion in model container [2024-01-31 17:41:13,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:13" (2/2) ... [2024-01-31 17:41:13,426 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:41:15,706 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:41:15,707 INFO L98 nessWitnessExtractor]: Location invariant after [L19-L19] expression == 1 [2024-01-31 17:41:15,708 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] expression == 0 [2024-01-31 17:41:15,754 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:41:15,876 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/safe019_power.opt.i[994,1007] [2024-01-31 17:41:16,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:41:16,025 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:41:16,033 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/safe019_power.opt.i[994,1007] Start Parsing Local [2024-01-31 17:41:16,055 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:41:16,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:41:16,147 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:41:16,152 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:16 WrapperNode [2024-01-31 17:41:16,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:41:16,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:41:16,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:41:16,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:41:16,159 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:41:16" (1/1) ... [2024-01-31 17:41:16,177 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:41:16" (1/1) ... [2024-01-31 17:41:16,220 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2024-01-31 17:41:16,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:41:16,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:41:16,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:41:16,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:41:16,231 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:41:16" (1/1) ... [2024-01-31 17:41:16,232 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:41:16" (1/1) ... [2024-01-31 17:41:16,246 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:41:16" (1/1) ... [2024-01-31 17:41:16,278 INFO L175 MemorySlicer]: Split 30 memory accesses to 6 slices as follows [2, 24, 1, 1, 1, 1]. 80 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0, 0]. The 12 writes are split as follows [0, 8, 1, 1, 1, 1]. [2024-01-31 17:41:16,278 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:41:16" (1/1) ... [2024-01-31 17:41:16,278 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:41:16" (1/1) ... [2024-01-31 17:41:16,288 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:41:16" (1/1) ... [2024-01-31 17:41:16,298 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:41:16" (1/1) ... [2024-01-31 17:41:16,301 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:41:16" (1/1) ... [2024-01-31 17:41:16,308 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:41:16" (1/1) ... [2024-01-31 17:41:16,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:41:16,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:41:16,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:41:16,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:41:16,318 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:41:16" (1/1) ... [2024-01-31 17:41:16,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:41:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:41:16,340 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:41:16,341 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:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-31 17:41:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:41:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:41:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:41:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:41:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:41:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:41:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-31 17:41:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:41:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:41:16,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:41:16,378 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:41:16,528 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:41:16,530 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:41:16,877 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:41:16,877 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:41:17,159 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:41:17,159 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:41:17,160 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:41:17 BoogieIcfgContainer [2024-01-31 17:41:17,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:41:17,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:41:17,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:41:17,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:41:17,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:41:12" (1/4) ... [2024-01-31 17:41:17,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e91fe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:41:17, skipping insertion in model container [2024-01-31 17:41:17,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:13" (2/4) ... [2024-01-31 17:41:17,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e91fe32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:41:17, skipping insertion in model container [2024-01-31 17:41:17,166 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:41:16" (3/4) ... [2024-01-31 17:41:17,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e91fe32 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:41:17, skipping insertion in model container [2024-01-31 17:41:17,167 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:41:17" (4/4) ... [2024-01-31 17:41:17,168 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2024-01-31 17:41:17,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:41:17,184 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:41:17,184 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:41:17,245 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:41:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-01-31 17:41:17,319 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-01-31 17:41:17,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:17,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-01-31 17:41:17,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-01-31 17:41:17,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-01-31 17:41:17,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:41:17,336 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;@78600faf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:41:17,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:41:17,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:41:17,341 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-01-31 17:41:17,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:17,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:17,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:41:17,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:17,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1667789102, now seen corresponding path program 1 times [2024-01-31 17:41:17,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915166271] [2024-01-31 17:41:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:17,520 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:41:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915166271] [2024-01-31 17:41:17,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915166271] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:17,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:17,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:41:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556563744] [2024-01-31 17:41:17,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:17,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:41:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:41:17,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:41:17,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2024-01-31 17:41:17,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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:41:17,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:17,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2024-01-31 17:41:17,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:18,722 INFO L124 PetriNetUnfolderBase]: 3768/6497 cut-off events. [2024-01-31 17:41:18,723 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-31 17:41:18,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11846 conditions, 6497 events. 3768/6497 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 49184 event pairs, 3768 based on Foata normal form. 180/5863 useless extension candidates. Maximal degree in co-relation 11834. Up to 5186 conditions per place. [2024-01-31 17:41:18,766 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 25 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-01-31 17:41:18,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 148 flow [2024-01-31 17:41:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:41:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:41:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2024-01-31 17:41:18,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2024-01-31 17:41:18,778 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 2 states and 71 transitions. [2024-01-31 17:41:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 148 flow [2024-01-31 17:41:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:18,787 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 94 flow [2024-01-31 17:41:18,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-01-31 17:41:18,792 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2024-01-31 17:41:18,793 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 94 flow [2024-01-31 17:41:18,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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:41:18,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:18,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 17:41:18,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:41:18,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:18,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1667789101, now seen corresponding path program 1 times [2024-01-31 17:41:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323858632] [2024-01-31 17:41:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:18,996 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:41:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323858632] [2024-01-31 17:41:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323858632] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:41:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768174254] [2024-01-31 17:41:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:18,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:41:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:41:19,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:41:19,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2024-01-31 17:41:19,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:41:19,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:19,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2024-01-31 17:41:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:19,780 INFO L124 PetriNetUnfolderBase]: 2959/4728 cut-off events. [2024-01-31 17:41:19,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:19,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8953 conditions, 4728 events. 2959/4728 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30853 event pairs, 868 based on Foata normal form. 0/4607 useless extension candidates. Maximal degree in co-relation 8950. Up to 3274 conditions per place. [2024-01-31 17:41:19,812 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-01-31 17:41:19,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 212 flow [2024-01-31 17:41:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:41:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:41:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-31 17:41:19,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2024-01-31 17:41:19,815 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 94 flow. Second operand 3 states and 108 transitions. [2024-01-31 17:41:19,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 212 flow [2024-01-31 17:41:19,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:41:19,818 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 94 flow [2024-01-31 17:41:19,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-01-31 17:41:19,819 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-01-31 17:41:19,820 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 94 flow [2024-01-31 17:41:19,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:41:19,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:19,820 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:41:19,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:41:19,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:19,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 469869104, now seen corresponding path program 1 times [2024-01-31 17:41:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587254025] [2024-01-31 17:41:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:19,896 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:41:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:19,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587254025] [2024-01-31 17:41:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587254025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:19,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:41:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338484874] [2024-01-31 17:41:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:41:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:41:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:41:19,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:19,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:41:19,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:19,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:20,815 INFO L124 PetriNetUnfolderBase]: 3775/5673 cut-off events. [2024-01-31 17:41:20,816 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-01-31 17:41:20,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11358 conditions, 5673 events. 3775/5673 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 36475 event pairs, 2959 based on Foata normal form. 0/5390 useless extension candidates. Maximal degree in co-relation 11354. Up to 4095 conditions per place. [2024-01-31 17:41:20,851 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 34 selfloop transitions, 1 changer transitions 1/50 dead transitions. [2024-01-31 17:41:20,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 186 flow [2024-01-31 17:41:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:41:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:41:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-01-31 17:41:20,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-01-31 17:41:20,853 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 91 transitions. [2024-01-31 17:41:20,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 186 flow [2024-01-31 17:41:20,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:41:20,854 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 88 flow [2024-01-31 17:41:20,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-01-31 17:41:20,855 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-01-31 17:41:20,855 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 88 flow [2024-01-31 17:41:20,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:41:20,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:20,856 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:41:20,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:41:20,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:20,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1681041154, now seen corresponding path program 1 times [2024-01-31 17:41:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:20,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063065918] [2024-01-31 17:41:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:20,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:21,070 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:41:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063065918] [2024-01-31 17:41:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063065918] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:21,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:41:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856479755] [2024-01-31 17:41:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:21,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:41:21,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:41:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:41:21,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-01-31 17:41:21,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:41:21,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:21,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-01-31 17:41:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:22,437 INFO L124 PetriNetUnfolderBase]: 6641/9841 cut-off events. [2024-01-31 17:41:22,437 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2024-01-31 17:41:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19309 conditions, 9841 events. 6641/9841 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 65920 event pairs, 1731 based on Foata normal form. 240/10062 useless extension candidates. Maximal degree in co-relation 19305. Up to 6943 conditions per place. [2024-01-31 17:41:22,493 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 37 selfloop transitions, 3 changer transitions 43/95 dead transitions. [2024-01-31 17:41:22,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 95 transitions, 368 flow [2024-01-31 17:41:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2024-01-31 17:41:22,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5743440233236151 [2024-01-31 17:41:22,495 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 88 flow. Second operand 7 states and 197 transitions. [2024-01-31 17:41:22,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 95 transitions, 368 flow [2024-01-31 17:41:22,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:41:22,510 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 122 flow [2024-01-31 17:41:22,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=122, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-01-31 17:41:22,511 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2024-01-31 17:41:22,511 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 122 flow [2024-01-31 17:41:22,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:41:22,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:22,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:22,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:41:22,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:22,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1411147487, now seen corresponding path program 1 times [2024-01-31 17:41:22,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:22,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269502604] [2024-01-31 17:41:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:22,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:22,750 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:41:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:22,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269502604] [2024-01-31 17:41:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269502604] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:41:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249838494] [2024-01-31 17:41:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:22,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:41:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:22,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:41:22,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:41:22,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:22,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:41:22,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:22,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:23,799 INFO L124 PetriNetUnfolderBase]: 4864/7413 cut-off events. [2024-01-31 17:41:23,799 INFO L125 PetriNetUnfolderBase]: For 2772/2772 co-relation queries the response was YES. [2024-01-31 17:41:23,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16946 conditions, 7413 events. 4864/7413 cut-off events. For 2772/2772 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 49782 event pairs, 1333 based on Foata normal form. 180/7433 useless extension candidates. Maximal degree in co-relation 16937. Up to 4669 conditions per place. [2024-01-31 17:41:23,842 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 35 selfloop transitions, 2 changer transitions 37/90 dead transitions. [2024-01-31 17:41:23,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 380 flow [2024-01-31 17:41:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-01-31 17:41:23,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5889212827988338 [2024-01-31 17:41:23,845 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 122 flow. Second operand 7 states and 202 transitions. [2024-01-31 17:41:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 380 flow [2024-01-31 17:41:23,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 369 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:41:23,870 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 131 flow [2024-01-31 17:41:23,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2024-01-31 17:41:23,871 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-01-31 17:41:23,871 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 131 flow [2024-01-31 17:41:23,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:41:23,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:23,872 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:41:23,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:41:23,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:23,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2035287635, now seen corresponding path program 1 times [2024-01-31 17:41:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:23,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705892757] [2024-01-31 17:41:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:23,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:24,036 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:41:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705892757] [2024-01-31 17:41:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705892757] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:41:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106262257] [2024-01-31 17:41:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:41:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:41:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:41:24,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-01-31 17:41:24,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:41:24,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:24,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-01-31 17:41:24,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:25,480 INFO L124 PetriNetUnfolderBase]: 8007/11915 cut-off events. [2024-01-31 17:41:25,480 INFO L125 PetriNetUnfolderBase]: For 7050/7050 co-relation queries the response was YES. [2024-01-31 17:41:25,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28351 conditions, 11915 events. 8007/11915 cut-off events. For 7050/7050 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 84000 event pairs, 3195 based on Foata normal form. 252/12148 useless extension candidates. Maximal degree in co-relation 28339. Up to 5243 conditions per place. [2024-01-31 17:41:25,533 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 43 selfloop transitions, 3 changer transitions 41/99 dead transitions. [2024-01-31 17:41:25,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 464 flow [2024-01-31 17:41:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-01-31 17:41:25,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5830903790087464 [2024-01-31 17:41:25,535 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 131 flow. Second operand 7 states and 200 transitions. [2024-01-31 17:41:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 464 flow [2024-01-31 17:41:25,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 430 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-01-31 17:41:25,623 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 136 flow [2024-01-31 17:41:25,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2024-01-31 17:41:25,625 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-01-31 17:41:25,626 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 136 flow [2024-01-31 17:41:25,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 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:41:25,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:25,626 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] [2024-01-31 17:41:25,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:41:25,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:25,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash -929488000, now seen corresponding path program 1 times [2024-01-31 17:41:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268908974] [2024-01-31 17:41:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:25,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:25,862 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:41:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:25,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268908974] [2024-01-31 17:41:25,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268908974] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:25,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:25,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:41:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668639684] [2024-01-31 17:41:25,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:25,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:41:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:41:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:41:25,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 17:41:25,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:41:25,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:25,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 17:41:25,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:27,468 INFO L124 PetriNetUnfolderBase]: 7886/12241 cut-off events. [2024-01-31 17:41:27,468 INFO L125 PetriNetUnfolderBase]: For 7426/7586 co-relation queries the response was YES. [2024-01-31 17:41:27,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27520 conditions, 12241 events. 7886/12241 cut-off events. For 7426/7586 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 85537 event pairs, 2747 based on Foata normal form. 336/12299 useless extension candidates. Maximal degree in co-relation 27507. Up to 7708 conditions per place. [2024-01-31 17:41:27,532 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 41 selfloop transitions, 2 changer transitions 37/95 dead transitions. [2024-01-31 17:41:27,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 429 flow [2024-01-31 17:41:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 201 transitions. [2024-01-31 17:41:27,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5860058309037901 [2024-01-31 17:41:27,534 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 136 flow. Second operand 7 states and 201 transitions. [2024-01-31 17:41:27,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 429 flow [2024-01-31 17:41:27,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 406 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-01-31 17:41:27,597 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 137 flow [2024-01-31 17:41:27,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-01-31 17:41:27,597 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2024-01-31 17:41:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 137 flow [2024-01-31 17:41:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:41:27,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:27,598 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:41:27,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:41:27,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:27,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1497279553, now seen corresponding path program 1 times [2024-01-31 17:41:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:27,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126112009] [2024-01-31 17:41:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:27,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:41:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126112009] [2024-01-31 17:41:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126112009] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:27,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:41:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648101690] [2024-01-31 17:41:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:27,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:41:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:27,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:41:27,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:41:27,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-01-31 17:41:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:41:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:27,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-01-31 17:41:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:29,831 INFO L124 PetriNetUnfolderBase]: 13043/19927 cut-off events. [2024-01-31 17:41:29,832 INFO L125 PetriNetUnfolderBase]: For 11466/11466 co-relation queries the response was YES. [2024-01-31 17:41:29,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46193 conditions, 19927 events. 13043/19927 cut-off events. For 11466/11466 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 144843 event pairs, 2171 based on Foata normal form. 252/20103 useless extension candidates. Maximal degree in co-relation 46179. Up to 9079 conditions per place. [2024-01-31 17:41:29,904 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 49 selfloop transitions, 4 changer transitions 28/92 dead transitions. [2024-01-31 17:41:29,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 450 flow [2024-01-31 17:41:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:41:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:41:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-01-31 17:41:29,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5850340136054422 [2024-01-31 17:41:29,906 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 137 flow. Second operand 6 states and 172 transitions. [2024-01-31 17:41:29,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 450 flow [2024-01-31 17:41:29,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 432 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-01-31 17:41:30,001 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 142 flow [2024-01-31 17:41:30,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2024-01-31 17:41:30,004 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-01-31 17:41:30,004 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 142 flow [2024-01-31 17:41:30,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:41:30,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:30,005 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:41:30,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:41:30,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:30,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1857025917, now seen corresponding path program 2 times [2024-01-31 17:41:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:30,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48423014] [2024-01-31 17:41:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:30,693 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:41:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48423014] [2024-01-31 17:41:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48423014] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:41:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122705137] [2024-01-31 17:41:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:30,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:41:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:41:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:41:30,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:30,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:41:30,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:30,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:32,097 INFO L124 PetriNetUnfolderBase]: 6301/10045 cut-off events. [2024-01-31 17:41:32,098 INFO L125 PetriNetUnfolderBase]: For 5190/5240 co-relation queries the response was YES. [2024-01-31 17:41:32,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22333 conditions, 10045 events. 6301/10045 cut-off events. For 5190/5240 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 71745 event pairs, 3887 based on Foata normal form. 258/10091 useless extension candidates. Maximal degree in co-relation 22320. Up to 7061 conditions per place. [2024-01-31 17:41:32,148 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 46 selfloop transitions, 11 changer transitions 43/116 dead transitions. [2024-01-31 17:41:32,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 116 transitions, 533 flow [2024-01-31 17:41:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-31 17:41:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-31 17:41:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 301 transitions. [2024-01-31 17:41:32,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-01-31 17:41:32,150 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 142 flow. Second operand 11 states and 301 transitions. [2024-01-31 17:41:32,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 116 transitions, 533 flow [2024-01-31 17:41:32,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 509 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-01-31 17:41:32,184 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 220 flow [2024-01-31 17:41:32,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=220, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2024-01-31 17:41:32,185 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2024-01-31 17:41:32,185 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 220 flow [2024-01-31 17:41:32,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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:41:32,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:32,186 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] [2024-01-31 17:41:32,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:41:32,186 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:32,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -552377105, now seen corresponding path program 1 times [2024-01-31 17:41:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400040843] [2024-01-31 17:41:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:33,778 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:41:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400040843] [2024-01-31 17:41:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400040843] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:41:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424674620] [2024-01-31 17:41:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:33,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:41:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:41:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:41:33,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:33,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 51 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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:41:33,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:33,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:33,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:35,222 INFO L124 PetriNetUnfolderBase]: 6268/9940 cut-off events. [2024-01-31 17:41:35,223 INFO L125 PetriNetUnfolderBase]: For 19809/19965 co-relation queries the response was YES. [2024-01-31 17:41:35,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30533 conditions, 9940 events. 6268/9940 cut-off events. For 19809/19965 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 69996 event pairs, 3542 based on Foata normal form. 277/10046 useless extension candidates. Maximal degree in co-relation 30514. Up to 5856 conditions per place. [2024-01-31 17:41:35,297 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 60 selfloop transitions, 14 changer transitions 49/139 dead transitions. [2024-01-31 17:41:35,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 835 flow [2024-01-31 17:41:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-31 17:41:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-31 17:41:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 311 transitions. [2024-01-31 17:41:35,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769944341372912 [2024-01-31 17:41:35,299 INFO L175 Difference]: Start difference. First operand has 78 places, 51 transitions, 220 flow. Second operand 11 states and 311 transitions. [2024-01-31 17:41:35,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 835 flow [2024-01-31 17:41:35,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 139 transitions, 815 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:35,376 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 348 flow [2024-01-31 17:41:35,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=348, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-01-31 17:41:35,377 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-01-31 17:41:35,377 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 348 flow [2024-01-31 17:41:35,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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:41:35,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:35,377 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] [2024-01-31 17:41:35,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:41:35,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:35,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 605250362, now seen corresponding path program 1 times [2024-01-31 17:41:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051653251] [2024-01-31 17:41:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:35,486 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:41:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051653251] [2024-01-31 17:41:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051653251] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:41:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160780587] [2024-01-31 17:41:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:35,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:41:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:41:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:41:35,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 17:41:35,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:41:35,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:35,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 17:41:35,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:38,191 INFO L124 PetriNetUnfolderBase]: 16847/24557 cut-off events. [2024-01-31 17:41:38,191 INFO L125 PetriNetUnfolderBase]: For 90825/91083 co-relation queries the response was YES. [2024-01-31 17:41:38,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88156 conditions, 24557 events. 16847/24557 cut-off events. For 90825/91083 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 163669 event pairs, 2235 based on Foata normal form. 847/25278 useless extension candidates. Maximal degree in co-relation 88131. Up to 13290 conditions per place. [2024-01-31 17:41:38,395 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 97 selfloop transitions, 6 changer transitions 1/117 dead transitions. [2024-01-31 17:41:38,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 923 flow [2024-01-31 17:41:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:41:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:41:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-01-31 17:41:38,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2024-01-31 17:41:38,397 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 348 flow. Second operand 4 states and 128 transitions. [2024-01-31 17:41:38,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 923 flow [2024-01-31 17:41:38,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 117 transitions, 847 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-01-31 17:41:38,564 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 349 flow [2024-01-31 17:41:38,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-01-31 17:41:38,565 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2024-01-31 17:41:38,565 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 349 flow [2024-01-31 17:41:38,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:41:38,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:38,565 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] [2024-01-31 17:41:38,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:41:38,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:38,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -325781601, now seen corresponding path program 1 times [2024-01-31 17:41:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:38,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340873731] [2024-01-31 17:41:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:38,689 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:41:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340873731] [2024-01-31 17:41:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340873731] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:38,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:41:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861519925] [2024-01-31 17:41:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:41:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:41:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:41:38,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 17:41:38,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:41:38,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:38,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 17:41:38,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:40,619 INFO L124 PetriNetUnfolderBase]: 12822/18773 cut-off events. [2024-01-31 17:41:40,619 INFO L125 PetriNetUnfolderBase]: For 58576/58780 co-relation queries the response was YES. [2024-01-31 17:41:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67261 conditions, 18773 events. 12822/18773 cut-off events. For 58576/58780 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 120200 event pairs, 966 based on Foata normal form. 781/19461 useless extension candidates. Maximal degree in co-relation 67239. Up to 8249 conditions per place. [2024-01-31 17:41:40,739 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 104 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2024-01-31 17:41:40,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 128 transitions, 962 flow [2024-01-31 17:41:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:41:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:41:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-01-31 17:41:40,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2024-01-31 17:41:40,740 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 349 flow. Second operand 5 states and 162 transitions. [2024-01-31 17:41:40,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 128 transitions, 962 flow [2024-01-31 17:41:40,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 897 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:40,781 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 369 flow [2024-01-31 17:41:40,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-01-31 17:41:40,782 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2024-01-31 17:41:40,782 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 369 flow [2024-01-31 17:41:40,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:41:40,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:40,782 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:41:40,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:41:40,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:40,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2128908894, now seen corresponding path program 1 times [2024-01-31 17:41:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426323876] [2024-01-31 17:41:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:40,939 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:41:40,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426323876] [2024-01-31 17:41:40,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426323876] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:40,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:40,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:41:40,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687235629] [2024-01-31 17:41:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:40,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:41:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:41:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:41:40,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 17:41:40,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:41:40,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:40,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 17:41:40,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:42,141 INFO L124 PetriNetUnfolderBase]: 8135/11804 cut-off events. [2024-01-31 17:41:42,142 INFO L125 PetriNetUnfolderBase]: For 25711/25873 co-relation queries the response was YES. [2024-01-31 17:41:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40651 conditions, 11804 events. 8135/11804 cut-off events. For 25711/25873 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 68044 event pairs, 497 based on Foata normal form. 534/12252 useless extension candidates. Maximal degree in co-relation 40630. Up to 3584 conditions per place. [2024-01-31 17:41:42,221 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 114 selfloop transitions, 14 changer transitions 1/142 dead transitions. [2024-01-31 17:41:42,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 142 transitions, 1043 flow [2024-01-31 17:41:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:41:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:41:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-01-31 17:41:42,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 17:41:42,224 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 369 flow. Second operand 6 states and 196 transitions. [2024-01-31 17:41:42,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 142 transitions, 1043 flow [2024-01-31 17:41:42,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 142 transitions, 1013 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:42,280 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 419 flow [2024-01-31 17:41:42,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-01-31 17:41:42,281 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 28 predicate places. [2024-01-31 17:41:42,281 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 419 flow [2024-01-31 17:41:42,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:41:42,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:42,281 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] [2024-01-31 17:41:42,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:41:42,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:42,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash -228917897, now seen corresponding path program 1 times [2024-01-31 17:41:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38756281] [2024-01-31 17:41:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:42,549 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:41:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:42,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38756281] [2024-01-31 17:41:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38756281] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:41:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317316287] [2024-01-31 17:41:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:42,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:41:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:42,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:41:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:41:42,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-01-31 17:41:42,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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:41:42,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:42,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-01-31 17:41:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:44,091 INFO L124 PetriNetUnfolderBase]: 9205/14514 cut-off events. [2024-01-31 17:41:44,092 INFO L125 PetriNetUnfolderBase]: For 27696/28576 co-relation queries the response was YES. [2024-01-31 17:41:44,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48203 conditions, 14514 events. 9205/14514 cut-off events. For 27696/28576 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 100173 event pairs, 2755 based on Foata normal form. 274/14159 useless extension candidates. Maximal degree in co-relation 48181. Up to 4363 conditions per place. [2024-01-31 17:41:44,204 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 110 selfloop transitions, 5 changer transitions 27/165 dead transitions. [2024-01-31 17:41:44,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 165 transitions, 1215 flow [2024-01-31 17:41:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-01-31 17:41:44,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2024-01-31 17:41:44,205 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 419 flow. Second operand 7 states and 198 transitions. [2024-01-31 17:41:44,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 165 transitions, 1215 flow [2024-01-31 17:41:44,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 165 transitions, 1166 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-01-31 17:41:44,301 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 407 flow [2024-01-31 17:41:44,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2024-01-31 17:41:44,302 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2024-01-31 17:41:44,302 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 407 flow [2024-01-31 17:41:44,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 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:41:44,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:44,302 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] [2024-01-31 17:41:44,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:41:44,303 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:44,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash 656167535, now seen corresponding path program 2 times [2024-01-31 17:41:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:44,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430674730] [2024-01-31 17:41:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:44,507 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:41:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430674730] [2024-01-31 17:41:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430674730] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:41:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410646331] [2024-01-31 17:41:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:41:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:41:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:41:44,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2024-01-31 17:41:44,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 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:41:44,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:44,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2024-01-31 17:41:44,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:45,969 INFO L124 PetriNetUnfolderBase]: 10083/14171 cut-off events. [2024-01-31 17:41:45,969 INFO L125 PetriNetUnfolderBase]: For 29575/30089 co-relation queries the response was YES. [2024-01-31 17:41:46,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47263 conditions, 14171 events. 10083/14171 cut-off events. For 29575/30089 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 81107 event pairs, 539 based on Foata normal form. 455/14362 useless extension candidates. Maximal degree in co-relation 47238. Up to 4644 conditions per place. [2024-01-31 17:41:46,062 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 89 selfloop transitions, 18 changer transitions 15/137 dead transitions. [2024-01-31 17:41:46,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 973 flow [2024-01-31 17:41:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-01-31 17:41:46,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064139941690962 [2024-01-31 17:41:46,064 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 407 flow. Second operand 7 states and 208 transitions. [2024-01-31 17:41:46,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 973 flow [2024-01-31 17:41:46,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 914 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-01-31 17:41:46,204 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 392 flow [2024-01-31 17:41:46,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2024-01-31 17:41:46,205 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-01-31 17:41:46,205 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 392 flow [2024-01-31 17:41:46,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 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:41:46,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:46,205 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] [2024-01-31 17:41:46,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:41:46,205 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:46,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -776474463, now seen corresponding path program 1 times [2024-01-31 17:41:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744759919] [2024-01-31 17:41:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:48,332 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:41:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744759919] [2024-01-31 17:41:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744759919] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:48,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:48,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-31 17:41:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79689954] [2024-01-31 17:41:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:48,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:41:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:41:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:41:48,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:48,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 392 flow. Second operand has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:41:48,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:48,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:50,343 INFO L124 PetriNetUnfolderBase]: 11125/18273 cut-off events. [2024-01-31 17:41:50,343 INFO L125 PetriNetUnfolderBase]: For 31075/32582 co-relation queries the response was YES. [2024-01-31 17:41:50,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56495 conditions, 18273 events. 11125/18273 cut-off events. For 31075/32582 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 149056 event pairs, 2493 based on Foata normal form. 53/16833 useless extension candidates. Maximal degree in co-relation 56475. Up to 4632 conditions per place. [2024-01-31 17:41:50,437 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 75 selfloop transitions, 20 changer transitions 26/151 dead transitions. [2024-01-31 17:41:50,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 948 flow [2024-01-31 17:41:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-31 17:41:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-31 17:41:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 310 transitions. [2024-01-31 17:41:50,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575139146567718 [2024-01-31 17:41:50,439 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 392 flow. Second operand 11 states and 310 transitions. [2024-01-31 17:41:50,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 948 flow [2024-01-31 17:41:50,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 151 transitions, 760 flow, removed 60 selfloop flow, removed 14 redundant places. [2024-01-31 17:41:50,779 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 401 flow [2024-01-31 17:41:50,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=401, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2024-01-31 17:41:50,779 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2024-01-31 17:41:50,779 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 401 flow [2024-01-31 17:41:50,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:41:50,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:50,780 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] [2024-01-31 17:41:50,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 17:41:50,780 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:50,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -180961221, now seen corresponding path program 2 times [2024-01-31 17:41:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564699023] [2024-01-31 17:41:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:51,521 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:41:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:51,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564699023] [2024-01-31 17:41:51,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564699023] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:51,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:51,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:41:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483458258] [2024-01-31 17:41:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:51,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:41:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:41:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:41:51,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:51,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 401 flow. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 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:41:51,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:51,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:51,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:54,635 INFO L124 PetriNetUnfolderBase]: 21279/35106 cut-off events. [2024-01-31 17:41:54,635 INFO L125 PetriNetUnfolderBase]: For 33573/34820 co-relation queries the response was YES. [2024-01-31 17:41:54,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89236 conditions, 35106 events. 21279/35106 cut-off events. For 33573/34820 co-relation queries the response was YES. Maximal size of possible extension queue 2864. Compared 316543 event pairs, 6083 based on Foata normal form. 132/32094 useless extension candidates. Maximal degree in co-relation 89218. Up to 13015 conditions per place. [2024-01-31 17:41:54,847 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 80 selfloop transitions, 22 changer transitions 25/157 dead transitions. [2024-01-31 17:41:54,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 157 transitions, 990 flow [2024-01-31 17:41:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:41:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:41:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 257 transitions. [2024-01-31 17:41:54,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5827664399092971 [2024-01-31 17:41:54,848 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 401 flow. Second operand 9 states and 257 transitions. [2024-01-31 17:41:54,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 157 transitions, 990 flow [2024-01-31 17:41:55,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 157 transitions, 939 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:55,102 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 588 flow [2024-01-31 17:41:55,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=588, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2024-01-31 17:41:55,102 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2024-01-31 17:41:55,103 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 588 flow [2024-01-31 17:41:55,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 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:41:55,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:55,103 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] [2024-01-31 17:41:55,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 17:41:55,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:41:55,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1122252651, now seen corresponding path program 3 times [2024-01-31 17:41:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396975478] [2024-01-31 17:41:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:56,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:41:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396975478] [2024-01-31 17:41:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396975478] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:56,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:56,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-31 17:41:56,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434325957] [2024-01-31 17:41:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:56,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:41:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:41:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:41:56,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:41:56,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 588 flow. Second operand has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:41:56,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:56,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:41:56,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:01,777 INFO L124 PetriNetUnfolderBase]: 29985/50068 cut-off events. [2024-01-31 17:42:01,778 INFO L125 PetriNetUnfolderBase]: For 67517/69158 co-relation queries the response was YES. [2024-01-31 17:42:02,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131724 conditions, 50068 events. 29985/50068 cut-off events. For 67517/69158 co-relation queries the response was YES. Maximal size of possible extension queue 4178. Compared 479134 event pairs, 10042 based on Foata normal form. 219/45851 useless extension candidates. Maximal degree in co-relation 131703. Up to 11003 conditions per place. [2024-01-31 17:42:02,129 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 84 selfloop transitions, 13 changer transitions 57/184 dead transitions. [2024-01-31 17:42:02,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 184 transitions, 1287 flow [2024-01-31 17:42:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-31 17:42:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-31 17:42:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 329 transitions. [2024-01-31 17:42:02,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-01-31 17:42:02,131 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 588 flow. Second operand 12 states and 329 transitions. [2024-01-31 17:42:02,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 184 transitions, 1287 flow [2024-01-31 17:42:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 184 transitions, 1229 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-01-31 17:42:03,032 INFO L231 Difference]: Finished difference. Result has 112 places, 93 transitions, 612 flow [2024-01-31 17:42:03,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=612, PETRI_PLACES=112, PETRI_TRANSITIONS=93} [2024-01-31 17:42:03,033 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 55 predicate places. [2024-01-31 17:42:03,033 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 93 transitions, 612 flow [2024-01-31 17:42:03,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:42:03,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:03,034 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] [2024-01-31 17:42:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-31 17:42:03,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:42:03,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 487713405, now seen corresponding path program 4 times [2024-01-31 17:42:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042431390] [2024-01-31 17:42:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:05,216 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:42:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042431390] [2024-01-31 17:42:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042431390] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-31 17:42:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977249333] [2024-01-31 17:42:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:05,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:42:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:42:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:42:05,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:42:05,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 93 transitions, 612 flow. Second operand has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:42:05,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:05,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:42:05,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:10,647 INFO L124 PetriNetUnfolderBase]: 29594/49432 cut-off events. [2024-01-31 17:42:10,647 INFO L125 PetriNetUnfolderBase]: For 74524/75772 co-relation queries the response was YES. [2024-01-31 17:42:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130952 conditions, 49432 events. 29594/49432 cut-off events. For 74524/75772 co-relation queries the response was YES. Maximal size of possible extension queue 4207. Compared 472853 event pairs, 11372 based on Foata normal form. 112/44772 useless extension candidates. Maximal degree in co-relation 130923. Up to 28671 conditions per place. [2024-01-31 17:42:11,043 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 94 selfloop transitions, 19 changer transitions 30/173 dead transitions. [2024-01-31 17:42:11,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 173 transitions, 1273 flow [2024-01-31 17:42:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-31 17:42:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-31 17:42:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 317 transitions. [2024-01-31 17:42:11,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391156462585034 [2024-01-31 17:42:11,045 INFO L175 Difference]: Start difference. First operand has 112 places, 93 transitions, 612 flow. Second operand 12 states and 317 transitions. [2024-01-31 17:42:11,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 173 transitions, 1273 flow [2024-01-31 17:42:12,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 173 transitions, 1240 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-01-31 17:42:12,082 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 792 flow [2024-01-31 17:42:12,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=792, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2024-01-31 17:42:12,083 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 60 predicate places. [2024-01-31 17:42:12,083 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 792 flow [2024-01-31 17:42:12,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:42:12,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:12,083 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] [2024-01-31 17:42:12,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-31 17:42:12,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:42:12,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1659931369, now seen corresponding path program 5 times [2024-01-31 17:42:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685825420] [2024-01-31 17:42:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:13,844 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:42:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685825420] [2024-01-31 17:42:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685825420] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:13,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-01-31 17:42:13,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970849209] [2024-01-31 17:42:13,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-31 17:42:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:13,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-31 17:42:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-01-31 17:42:13,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-01-31 17:42:13,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 792 flow. Second operand has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:42:13,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:13,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-01-31 17:42:13,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:18,364 INFO L124 PetriNetUnfolderBase]: 25091/42148 cut-off events. [2024-01-31 17:42:18,365 INFO L125 PetriNetUnfolderBase]: For 83397/85010 co-relation queries the response was YES. [2024-01-31 17:42:18,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118217 conditions, 42148 events. 25091/42148 cut-off events. For 83397/85010 co-relation queries the response was YES. Maximal size of possible extension queue 3579. Compared 398166 event pairs, 10248 based on Foata normal form. 156/38427 useless extension candidates. Maximal degree in co-relation 118186. Up to 23869 conditions per place. [2024-01-31 17:42:18,699 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 74 selfloop transitions, 7 changer transitions 46/157 dead transitions. [2024-01-31 17:42:18,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 157 transitions, 1281 flow [2024-01-31 17:42:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:42:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:42:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 259 transitions. [2024-01-31 17:42:18,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-01-31 17:42:18,700 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 792 flow. Second operand 10 states and 259 transitions. [2024-01-31 17:42:18,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 157 transitions, 1281 flow [2024-01-31 17:42:19,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 157 transitions, 1186 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-01-31 17:42:19,732 INFO L231 Difference]: Finished difference. Result has 121 places, 98 transitions, 701 flow [2024-01-31 17:42:19,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=701, PETRI_PLACES=121, PETRI_TRANSITIONS=98} [2024-01-31 17:42:19,733 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2024-01-31 17:42:19,733 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 98 transitions, 701 flow [2024-01-31 17:42:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.75) internal successors, (237), 12 states have internal predecessors, (237), 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:42:19,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:19,733 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] [2024-01-31 17:42:19,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-31 17:42:19,733 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:42:19,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1364304503, now seen corresponding path program 6 times [2024-01-31 17:42:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:19,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760790719] [2024-01-31 17:42:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:42:19,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:42:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:42:19,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:42:19,849 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:42:19,849 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:42:19,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:42:19,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:42:19,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:42:19,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:42:19,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-31 17:42:19,852 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:42:19,857 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:42:19,857 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:42:19,937 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:42:19,937 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:42:19,938 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:42:19 BasicIcfg [2024-01-31 17:42:19,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:42:19,938 INFO L158 Benchmark]: Toolchain (without parser) took 66522.86ms. Allocated memory was 180.4MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 110.0MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-01-31 17:42:19,939 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:42:19,939 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 100.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:42:19,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2735.68ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 110.0MB in the beginning and 92.1MB in the end (delta: 17.9MB). Peak memory consumption was 204.1MB. Max. memory is 16.1GB. [2024-01-31 17:42:19,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.77ms. Allocated memory is still 346.0MB. Free memory was 92.1MB in the beginning and 88.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:42:19,939 INFO L158 Benchmark]: Boogie Preprocessor took 93.80ms. Allocated memory is still 346.0MB. Free memory was 88.9MB in the beginning and 84.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:42:19,940 INFO L158 Benchmark]: RCFGBuilder took 843.34ms. Allocated memory is still 346.0MB. Free memory was 83.7MB in the beginning and 167.2MB in the end (delta: -83.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-01-31 17:42:19,940 INFO L158 Benchmark]: TraceAbstraction took 62775.66ms. Allocated memory was 346.0MB in the beginning and 6.9GB in the end (delta: 6.6GB). Free memory was 167.2MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-31 17:42:19,941 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.17ms. Allocated memory is still 130.0MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 100.0MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2735.68ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 110.0MB in the beginning and 92.1MB in the end (delta: 17.9MB). Peak memory consumption was 204.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.77ms. Allocated memory is still 346.0MB. Free memory was 92.1MB in the beginning and 88.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.80ms. Allocated memory is still 346.0MB. Free memory was 88.9MB in the beginning and 84.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 843.34ms. Allocated memory is still 346.0MB. Free memory was 83.7MB in the beginning and 167.2MB in the end (delta: -83.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62775.66ms. Allocated memory was 346.0MB in the beginning and 6.9GB in the end (delta: 6.6GB). Free memory was 167.2MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L884] 0 pthread_t t2230; [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L886] 0 pthread_t t2231; [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L888] 0 pthread_t t2232; [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L843] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 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 = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 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 [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 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) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 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_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 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) [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L895] 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) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 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 [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 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 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={6:0}, t2230={7:0}, t2231={8:0}, t2232={5:0}, weak$$choice1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L906] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L19] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 19]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: 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: 19]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 885]: 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: 887]: 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: 889]: 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: 883]: 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, 81 locations, 10 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: 62.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 49.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1264 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1215 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 412 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5157 IncrementalHoareTripleChecker+Invalid, 5334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 24 mSDtfsCounter, 5157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=19, InterpolantAutomatonStates: 147, 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.5s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 6019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:42:19,970 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