./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.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:36:30,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:36:30,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:36:30,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:36:30,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:36:30,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:36:30,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:36:30,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:36:30,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:36:30,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:36:30,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:36:30,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:36:30,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:36:30,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:36:30,317 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:36:30,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:36:30,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:36:30,318 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:36:30,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:36:30,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:36:30,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:36:30,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:36:30,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:36:30,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:36:30,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:36:30,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:36:30,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:36:30,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:36:30,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:36:30,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:36:30,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:36:30,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:36:30,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:36:30,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:36:30,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:36:30,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:36:30,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:36:30,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:36:30,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:36:30,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:36:30,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:36:30,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:36:30,555 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:36:30,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-31 17:36:31,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:36:31,757 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:36:31,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-31 17:36:31,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf946827/2ac0d5adfc324776846e25e63ecae37b/FLAGb41fc0340 [2024-01-31 17:36:31,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf946827/2ac0d5adfc324776846e25e63ecae37b [2024-01-31 17:36:31,781 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:36:31,781 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:36:31,782 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml [2024-01-31 17:36:32,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:36:32,276 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:36:32,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:36:32,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:36:32,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:36:32,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:36:31" (1/2) ... [2024-01-31 17:36:32,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d31f633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:36:31" (1/2) ... [2024-01-31 17:36:32,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@362d9b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:32" (2/2) ... [2024-01-31 17:36:32,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d31f633 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:32, skipping insertion in model container [2024-01-31 17:36:32,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:32" (2/2) ... [2024-01-31 17:36:32,287 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:36:33,916 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:36:33,917 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:36:33,918 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:36:33,944 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:36:34,149 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2024-01-31 17:36:34,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:34,276 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:36:34,284 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] Start Parsing Local [2024-01-31 17:36:34,313 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:36:34,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:36:34,386 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:36:34,389 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34 WrapperNode [2024-01-31 17:36:34,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:36:34,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:34,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:36:34,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:36:34,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,458 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2024-01-31 17:36:34,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:36:34,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:36:34,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:36:34,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:36:34,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,512 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 17:36:34,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:36:34,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:36:34,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:36:34,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:36:34,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (1/1) ... [2024-01-31 17:36:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:36:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:36:34,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:36:34,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:36:34,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:36:34,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:36:34,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:36:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:36:34,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:36:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:36:34,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:36:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:36:34,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:36:34,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:36:34,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:36:34,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:36:34,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:36:34,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:36:34,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:36:34,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:36:34,610 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:36:34,754 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:36:34,757 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:36:34,998 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:36:34,998 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:36:35,101 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:36:35,101 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:36:35,101 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:35 BoogieIcfgContainer [2024-01-31 17:36:35,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:36:35,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:36:35,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:36:35,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:36:35,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:36:31" (1/4) ... [2024-01-31 17:36:35,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c41358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:36:35, skipping insertion in model container [2024-01-31 17:36:35,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:36:32" (2/4) ... [2024-01-31 17:36:35,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c41358 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:36:35, skipping insertion in model container [2024-01-31 17:36:35,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:36:34" (3/4) ... [2024-01-31 17:36:35,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c41358 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:36:35, skipping insertion in model container [2024-01-31 17:36:35,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:36:35" (4/4) ... [2024-01-31 17:36:35,107 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-01-31 17:36:35,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:36:35,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:36:35,121 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:36:35,153 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:36:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2024-01-31 17:36:35,209 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2024-01-31 17:36:35,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:35,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-01-31 17:36:35,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2024-01-31 17:36:35,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2024-01-31 17:36:35,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:36:35,227 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;@60c2ead0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:36:35,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-01-31 17:36:35,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:36:35,230 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-31 17:36:35,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:35,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:35,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:36:35,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:35,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 11662397, now seen corresponding path program 1 times [2024-01-31 17:36:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747810644] [2024-01-31 17:36:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:35,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747810644] [2024-01-31 17:36:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747810644] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781721846] [2024-01-31 17:36:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:35,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:36:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:36:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:36:35,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-01-31 17:36:35,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:35,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:35,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-01-31 17:36:35,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:35,782 INFO L124 PetriNetUnfolderBase]: 791/1560 cut-off events. [2024-01-31 17:36:35,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:35,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1560 events. 791/1560 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10505 event pairs, 791 based on Foata normal form. 45/1402 useless extension candidates. Maximal degree in co-relation 2788. Up to 1193 conditions per place. [2024-01-31 17:36:35,798 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 20 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-01-31 17:36:35,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 125 flow [2024-01-31 17:36:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:36:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:36:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2024-01-31 17:36:35,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-01-31 17:36:35,811 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 2 states and 64 transitions. [2024-01-31 17:36:35,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 125 flow [2024-01-31 17:36:35,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 17:36:35,817 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2024-01-31 17:36:35,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-01-31 17:36:35,821 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-01-31 17:36:35,821 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2024-01-31 17:36:35,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:35,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:35,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 17:36:35,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:36:35,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:35,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash 11662398, now seen corresponding path program 1 times [2024-01-31 17:36:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:35,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233266355] [2024-01-31 17:36:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233266355] [2024-01-31 17:36:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233266355] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:36:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171550349] [2024-01-31 17:36:35,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:35,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:35,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-01-31 17:36:35,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:35,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:35,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-01-31 17:36:35,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:36,237 INFO L124 PetriNetUnfolderBase]: 617/1115 cut-off events. [2024-01-31 17:36:36,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:36:36,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1115 events. 617/1115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6372 event pairs, 343 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 2087. Up to 763 conditions per place. [2024-01-31 17:36:36,243 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 29 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-01-31 17:36:36,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 178 flow [2024-01-31 17:36:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-01-31 17:36:36,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-01-31 17:36:36,245 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 97 transitions. [2024-01-31 17:36:36,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 178 flow [2024-01-31 17:36:36,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:36:36,247 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 82 flow [2024-01-31 17:36:36,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-01-31 17:36:36,248 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-01-31 17:36:36,248 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 82 flow [2024-01-31 17:36:36,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:36,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:36,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:36:36,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:36,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1709949169, now seen corresponding path program 1 times [2024-01-31 17:36:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966230606] [2024-01-31 17:36:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966230606] [2024-01-31 17:36:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966230606] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:36:36,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135603810] [2024-01-31 17:36:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:36,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:36:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:36,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:36:36,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:36:36,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:36:36,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:36,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:36:36,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:36,468 INFO L124 PetriNetUnfolderBase]: 825/1453 cut-off events. [2024-01-31 17:36:36,469 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-31 17:36:36,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2838 conditions, 1453 events. 825/1453 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8869 event pairs, 617 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2834. Up to 939 conditions per place. [2024-01-31 17:36:36,476 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-01-31 17:36:36,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 156 flow [2024-01-31 17:36:36,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:36:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:36:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-01-31 17:36:36,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-01-31 17:36:36,477 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 82 flow. Second operand 3 states and 81 transitions. [2024-01-31 17:36:36,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 156 flow [2024-01-31 17:36:36,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:36,478 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 76 flow [2024-01-31 17:36:36,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-01-31 17:36:36,479 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2024-01-31 17:36:36,479 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 76 flow [2024-01-31 17:36:36,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:36,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:36,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:36:36,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:36,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1468816329, now seen corresponding path program 1 times [2024-01-31 17:36:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:36,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460030521] [2024-01-31 17:36:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:36,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460030521] [2024-01-31 17:36:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460030521] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:36:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598656035] [2024-01-31 17:36:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:36,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:36:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:36:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:36:36,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-01-31 17:36:36,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:36,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:36,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-01-31 17:36:36,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:37,416 INFO L124 PetriNetUnfolderBase]: 4377/6968 cut-off events. [2024-01-31 17:36:37,417 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-01-31 17:36:37,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13692 conditions, 6968 events. 4377/6968 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 46665 event pairs, 1177 based on Foata normal form. 204/7139 useless extension candidates. Maximal degree in co-relation 13688. Up to 3225 conditions per place. [2024-01-31 17:36:37,446 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 41 selfloop transitions, 6 changer transitions 51/107 dead transitions. [2024-01-31 17:36:37,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 424 flow [2024-01-31 17:36:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:36:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:36:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-01-31 17:36:37,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6112956810631229 [2024-01-31 17:36:37,452 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 76 flow. Second operand 7 states and 184 transitions. [2024-01-31 17:36:37,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 424 flow [2024-01-31 17:36:37,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 107 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:36:37,473 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 149 flow [2024-01-31 17:36:37,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-01-31 17:36:37,475 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-01-31 17:36:37,475 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 149 flow [2024-01-31 17:36:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:37,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:37,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:37,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:36:37,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:37,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 944401526, now seen corresponding path program 1 times [2024-01-31 17:36:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804594818] [2024-01-31 17:36:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804594818] [2024-01-31 17:36:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804594818] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:37,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:37,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:37,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623007877] [2024-01-31 17:36:37,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:37,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:37,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-01-31 17:36:37,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:37,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:37,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-01-31 17:36:37,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:38,417 INFO L124 PetriNetUnfolderBase]: 3753/6110 cut-off events. [2024-01-31 17:36:38,417 INFO L125 PetriNetUnfolderBase]: For 5006/5009 co-relation queries the response was YES. [2024-01-31 17:36:38,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16237 conditions, 6110 events. 3753/6110 cut-off events. For 5006/5009 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 40226 event pairs, 707 based on Foata normal form. 196/6287 useless extension candidates. Maximal degree in co-relation 16228. Up to 2229 conditions per place. [2024-01-31 17:36:38,450 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 48 selfloop transitions, 6 changer transitions 66/129 dead transitions. [2024-01-31 17:36:38,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 722 flow [2024-01-31 17:36:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:36:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:36:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2024-01-31 17:36:38,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541860465116279 [2024-01-31 17:36:38,453 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 149 flow. Second operand 10 states and 233 transitions. [2024-01-31 17:36:38,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 722 flow [2024-01-31 17:36:38,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 658 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:38,466 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 189 flow [2024-01-31 17:36:38,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=189, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2024-01-31 17:36:38,466 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2024-01-31 17:36:38,467 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 189 flow [2024-01-31 17:36:38,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:38,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:38,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:38,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:36:38,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:38,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1922863533, now seen corresponding path program 1 times [2024-01-31 17:36:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:38,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237638110] [2024-01-31 17:36:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237638110] [2024-01-31 17:36:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237638110] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:36:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873212522] [2024-01-31 17:36:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:38,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:36:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:38,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:36:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:36:38,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:36:38,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:38,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:38,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:36:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:39,044 INFO L124 PetriNetUnfolderBase]: 3285/5712 cut-off events. [2024-01-31 17:36:39,044 INFO L125 PetriNetUnfolderBase]: For 5659/6907 co-relation queries the response was YES. [2024-01-31 17:36:39,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14062 conditions, 5712 events. 3285/5712 cut-off events. For 5659/6907 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39191 event pairs, 481 based on Foata normal form. 263/5808 useless extension candidates. Maximal degree in co-relation 14045. Up to 2649 conditions per place. [2024-01-31 17:36:39,076 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 45 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-01-31 17:36:39,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 371 flow [2024-01-31 17:36:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:36:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:36:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-01-31 17:36:39,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6802325581395349 [2024-01-31 17:36:39,078 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 189 flow. Second operand 4 states and 117 transitions. [2024-01-31 17:36:39,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 371 flow [2024-01-31 17:36:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 350 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-01-31 17:36:39,101 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 206 flow [2024-01-31 17:36:39,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2024-01-31 17:36:39,102 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-01-31 17:36:39,102 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 206 flow [2024-01-31 17:36:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:39,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:39,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] [2024-01-31 17:36:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:36:39,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:39,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1395182422, now seen corresponding path program 1 times [2024-01-31 17:36:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306437049] [2024-01-31 17:36:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:39,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:39,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306437049] [2024-01-31 17:36:39,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306437049] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:39,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:39,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:36:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413614324] [2024-01-31 17:36:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:39,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:36:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:36:39,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:36:39,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:36:39,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:39,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:39,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:36:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:39,675 INFO L124 PetriNetUnfolderBase]: 2450/4159 cut-off events. [2024-01-31 17:36:39,675 INFO L125 PetriNetUnfolderBase]: For 2991/3659 co-relation queries the response was YES. [2024-01-31 17:36:39,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11041 conditions, 4159 events. 2450/4159 cut-off events. For 2991/3659 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 26082 event pairs, 330 based on Foata normal form. 214/4236 useless extension candidates. Maximal degree in co-relation 11025. Up to 1277 conditions per place. [2024-01-31 17:36:39,702 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 58 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2024-01-31 17:36:39,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 473 flow [2024-01-31 17:36:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:36:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:36:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-01-31 17:36:39,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6930232558139535 [2024-01-31 17:36:39,704 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 206 flow. Second operand 5 states and 149 transitions. [2024-01-31 17:36:39,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 473 flow [2024-01-31 17:36:39,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 462 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-01-31 17:36:39,708 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 250 flow [2024-01-31 17:36:39,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-01-31 17:36:39,709 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-01-31 17:36:39,709 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 250 flow [2024-01-31 17:36:39,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:39,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:39,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:39,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:36:39,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:39,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 197946207, now seen corresponding path program 1 times [2024-01-31 17:36:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787855937] [2024-01-31 17:36:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787855937] [2024-01-31 17:36:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787855937] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:36:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845509468] [2024-01-31 17:36:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:40,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:36:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:36:40,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:36:40,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-01-31 17:36:40,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:40,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:40,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-01-31 17:36:40,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:40,839 INFO L124 PetriNetUnfolderBase]: 2669/5170 cut-off events. [2024-01-31 17:36:40,841 INFO L125 PetriNetUnfolderBase]: For 4640/5506 co-relation queries the response was YES. [2024-01-31 17:36:40,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14095 conditions, 5170 events. 2669/5170 cut-off events. For 4640/5506 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 40718 event pairs, 773 based on Foata normal form. 113/4922 useless extension candidates. Maximal degree in co-relation 14081. Up to 1940 conditions per place. [2024-01-31 17:36:40,873 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 8 changer transitions 24/113 dead transitions. [2024-01-31 17:36:40,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 113 transitions, 638 flow [2024-01-31 17:36:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:36:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:36:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-01-31 17:36:40,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5891472868217055 [2024-01-31 17:36:40,875 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 250 flow. Second operand 9 states and 228 transitions. [2024-01-31 17:36:40,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 113 transitions, 638 flow [2024-01-31 17:36:40,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 626 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-31 17:36:40,882 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 296 flow [2024-01-31 17:36:40,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2024-01-31 17:36:40,884 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2024-01-31 17:36:40,884 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 296 flow [2024-01-31 17:36:40,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:40,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:40,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:40,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:36:40,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:40,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -36556835, now seen corresponding path program 2 times [2024-01-31 17:36:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586795531] [2024-01-31 17:36:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586795531] [2024-01-31 17:36:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586795531] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:41,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:36:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580964308] [2024-01-31 17:36:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:41,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:41,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:41,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:41,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:36:41,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:41,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:41,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:36:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:41,568 INFO L124 PetriNetUnfolderBase]: 2965/5009 cut-off events. [2024-01-31 17:36:41,568 INFO L125 PetriNetUnfolderBase]: For 8752/9620 co-relation queries the response was YES. [2024-01-31 17:36:41,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16031 conditions, 5009 events. 2965/5009 cut-off events. For 8752/9620 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33126 event pairs, 379 based on Foata normal form. 168/5040 useless extension candidates. Maximal degree in co-relation 16012. Up to 1868 conditions per place. [2024-01-31 17:36:41,599 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 59 selfloop transitions, 11 changer transitions 3/91 dead transitions. [2024-01-31 17:36:41,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 600 flow [2024-01-31 17:36:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:36:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:36:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2024-01-31 17:36:41,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6317829457364341 [2024-01-31 17:36:41,600 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 296 flow. Second operand 6 states and 163 transitions. [2024-01-31 17:36:41,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 600 flow [2024-01-31 17:36:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 584 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-01-31 17:36:41,607 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 308 flow [2024-01-31 17:36:41,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2024-01-31 17:36:41,608 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2024-01-31 17:36:41,608 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 308 flow [2024-01-31 17:36:41,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:41,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:41,608 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] [2024-01-31 17:36:41,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:36:41,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:41,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1151622702, now seen corresponding path program 1 times [2024-01-31 17:36:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444801382] [2024-01-31 17:36:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444801382] [2024-01-31 17:36:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444801382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:42,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:42,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-31 17:36:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115451811] [2024-01-31 17:36:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-31 17:36:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-31 17:36:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-01-31 17:36:42,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-01-31 17:36:42,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 308 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:42,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:42,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-01-31 17:36:42,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:43,040 INFO L124 PetriNetUnfolderBase]: 2657/4981 cut-off events. [2024-01-31 17:36:43,040 INFO L125 PetriNetUnfolderBase]: For 9329/9744 co-relation queries the response was YES. [2024-01-31 17:36:43,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16302 conditions, 4981 events. 2657/4981 cut-off events. For 9329/9744 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 36855 event pairs, 591 based on Foata normal form. 84/4725 useless extension candidates. Maximal degree in co-relation 16285. Up to 1577 conditions per place. [2024-01-31 17:36:43,069 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 86 selfloop transitions, 38 changer transitions 22/163 dead transitions. [2024-01-31 17:36:43,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 163 transitions, 1083 flow [2024-01-31 17:36:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-31 17:36:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-31 17:36:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 272 transitions. [2024-01-31 17:36:43,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4865831842576029 [2024-01-31 17:36:43,071 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 308 flow. Second operand 13 states and 272 transitions. [2024-01-31 17:36:43,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 163 transitions, 1083 flow [2024-01-31 17:36:43,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 163 transitions, 1003 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-01-31 17:36:43,123 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 613 flow [2024-01-31 17:36:43,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=613, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2024-01-31 17:36:43,124 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-01-31 17:36:43,124 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 613 flow [2024-01-31 17:36:43,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:43,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:43,125 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] [2024-01-31 17:36:43,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:36:43,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:43,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -498047904, now seen corresponding path program 2 times [2024-01-31 17:36:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622253382] [2024-01-31 17:36:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622253382] [2024-01-31 17:36:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622253382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:36:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904020911] [2024-01-31 17:36:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:43,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:36:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:43,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:36:43,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:36:43,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-01-31 17:36:43,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:43,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:43,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-01-31 17:36:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:43,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][85], [24#L814true, Black: 65#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 135#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 1)), Black: 133#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1)), 126#(= ~z$r_buff0_thd3~0 0), Black: 83#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 154#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 160#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 29#P1EXITtrue, 16#L765true, 80#true, 36#L843-3true, 108#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 117#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 165#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0)), Black: 180#(and (= ~z$w_buff0~0 ~__unbuffered_p0_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 163#true, Black: 174#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z$w_buff0~0 0)), 55#true, Black: 167#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0)))]) [2024-01-31 17:36:43,579 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-01-31 17:36:43,580 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:36:43,580 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:36:43,580 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-31 17:36:43,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][85], [24#L814true, Black: 65#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 135#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 1)), Black: 133#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1)), 7#L844true, 126#(= ~z$r_buff0_thd3~0 0), Black: 83#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 154#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 160#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 29#P1EXITtrue, 16#L765true, 80#true, 108#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 117#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0)), Black: 180#(and (= ~z$w_buff0~0 ~__unbuffered_p0_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 163#true, Black: 174#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z$w_buff0~0 0)), Black: 167#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0))), 55#true]) [2024-01-31 17:36:43,613 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-01-31 17:36:43,613 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:36:43,613 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:36:43,613 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-01-31 17:36:43,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L798-->L814: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_62 256) 0)) (.cse5 (= (mod v_~z$r_buff0_thd3~0_64 256) 0))) (let ((.cse6 (not .cse5)) (.cse1 (and (= (mod v_~z$w_buff1_used~0_101 256) 0) .cse5)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse3 (and .cse5 .cse10))) (let ((.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and (not .cse11) .cse6)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~z$w_buff0_used~0_115 256) 0)) (.cse4 (= (mod v_~z$w_buff1_used~0_100 256) 0))) (and (= v_~z$w_buff1~0_35 v_~z$w_buff1~0_34) (= v_~z$w_buff1_used~0_100 (ite .cse0 v_~z$w_buff1_used~0_101 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_101 0))) (= v_~z$r_buff0_thd3~0_63 (ite .cse0 v_~z$r_buff0_thd3~0_64 (ite (or (and .cse4 .cse5) .cse2 .cse3) v_~z$r_buff0_thd3~0_64 (ite (and (not .cse2) .cse6) 0 v_~z$r_buff0_thd3~0_64)))) (= (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116))) v_~z$w_buff0_used~0_115) (= v_~z$w_buff0~0_39 v_~z$w_buff0~0_40) (= v_~z~0_58 (ite .cse0 v_~z$mem_tmp~0_18 v_~__unbuffered_p2_EBX~0_16)) (= v_~z$flush_delayed~0_31 0) (= v_~z$mem_tmp~0_18 v_~z~0_59) (= v_~__unbuffered_p2_EBX~0_16 (ite .cse7 v_~z~0_59 (ite .cse8 v_~z$w_buff0~0_40 v_~z$w_buff1~0_35))) (= v_~z$r_buff1_thd3~0_61 (ite .cse0 v_~z$r_buff1_thd3~0_62 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd3~0_63 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse4 .cse9))) v_~z$r_buff1_thd3~0_62 0))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_40, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_101, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_64, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~z~0=v_~z~0_59} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_18, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_61, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_100, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~z$flush_delayed~0=v_~z$flush_delayed~0_31, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~z~0=v_~z~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet4, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet3, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][85], [24#L814true, Black: 65#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 158#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 135#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 1)), Black: 133#(and (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd1~0 1) (= ~z$r_buff1_thd3~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1)), 126#(= ~z$r_buff0_thd3~0 0), 23#L846true, Black: 83#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 154#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 160#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 29#P1EXITtrue, 16#L765true, 80#true, 108#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 110#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 199#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 117#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 165#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 0)), Black: 180#(and (= ~z$w_buff0~0 ~__unbuffered_p0_EAX~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 163#true, Black: 174#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~z$w_buff0~0 0)), Black: 167#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (= ~z$r_buff0_thd1~0 1) (not (= ~z$w_buff0~0 0))), 55#true]) [2024-01-31 17:36:43,649 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-01-31 17:36:43,649 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:36:43,649 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:36:43,649 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-31 17:36:43,839 INFO L124 PetriNetUnfolderBase]: 2328/4793 cut-off events. [2024-01-31 17:36:43,839 INFO L125 PetriNetUnfolderBase]: For 8359/9155 co-relation queries the response was YES. [2024-01-31 17:36:43,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15622 conditions, 4793 events. 2328/4793 cut-off events. For 8359/9155 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 38348 event pairs, 678 based on Foata normal form. 94/4505 useless extension candidates. Maximal degree in co-relation 15600. Up to 1909 conditions per place. [2024-01-31 17:36:43,862 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 1 changer transitions 63/122 dead transitions. [2024-01-31 17:36:43,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 122 transitions, 925 flow [2024-01-31 17:36:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:36:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:36:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-01-31 17:36:43,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-01-31 17:36:43,864 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 613 flow. Second operand 6 states and 138 transitions. [2024-01-31 17:36:43,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 122 transitions, 925 flow [2024-01-31 17:36:43,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 122 transitions, 892 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-01-31 17:36:43,910 INFO L231 Difference]: Finished difference. Result has 89 places, 54 transitions, 324 flow [2024-01-31 17:36:43,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=89, PETRI_TRANSITIONS=54} [2024-01-31 17:36:43,911 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2024-01-31 17:36:43,911 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 54 transitions, 324 flow [2024-01-31 17:36:43,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:43,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:43,911 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] [2024-01-31 17:36:43,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:36:43,912 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:43,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 167188706, now seen corresponding path program 3 times [2024-01-31 17:36:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94530920] [2024-01-31 17:36:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:36:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:36:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:36:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94530920] [2024-01-31 17:36:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94530920] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:36:44,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:36:44,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:36:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119835844] [2024-01-31 17:36:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:36:44,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:36:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:36:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:36:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:36:44,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-01-31 17:36:44,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 54 transitions, 324 flow. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:44,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:36:44,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-01-31 17:36:44,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:36:44,922 INFO L124 PetriNetUnfolderBase]: 891/1860 cut-off events. [2024-01-31 17:36:44,922 INFO L125 PetriNetUnfolderBase]: For 2547/2899 co-relation queries the response was YES. [2024-01-31 17:36:44,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5548 conditions, 1860 events. 891/1860 cut-off events. For 2547/2899 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12611 event pairs, 208 based on Foata normal form. 59/1722 useless extension candidates. Maximal degree in co-relation 5523. Up to 630 conditions per place. [2024-01-31 17:36:44,931 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 36 selfloop transitions, 6 changer transitions 23/93 dead transitions. [2024-01-31 17:36:44,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 583 flow [2024-01-31 17:36:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:36:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:36:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2024-01-31 17:36:44,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297157622739018 [2024-01-31 17:36:44,933 INFO L175 Difference]: Start difference. First operand has 89 places, 54 transitions, 324 flow. Second operand 9 states and 205 transitions. [2024-01-31 17:36:44,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 583 flow [2024-01-31 17:36:44,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 535 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-01-31 17:36:44,943 INFO L231 Difference]: Finished difference. Result has 84 places, 54 transitions, 314 flow [2024-01-31 17:36:44,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=84, PETRI_TRANSITIONS=54} [2024-01-31 17:36:44,943 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-01-31 17:36:44,943 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 54 transitions, 314 flow [2024-01-31 17:36:44,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:36:44,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:36:44,944 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] [2024-01-31 17:36:44,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:36:44,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:36:44,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:36:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1868753918, now seen corresponding path program 4 times [2024-01-31 17:36:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:36:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577804075] [2024-01-31 17:36:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:36:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:36:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:36:45,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:36:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:36:45,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:36:45,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:36:45,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-01-31 17:36:45,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 9 remaining) [2024-01-31 17:36:45,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-01-31 17:36:45,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-01-31 17:36:45,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-01-31 17:36:45,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-01-31 17:36:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-01-31 17:36:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 9 remaining) [2024-01-31 17:36:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-01-31 17:36:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:36:45,107 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:36:45,112 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:36:45,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:36:45,175 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:36:45,175 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:36:45,176 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:36:45 BasicIcfg [2024-01-31 17:36:45,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:36:45,177 INFO L158 Benchmark]: Toolchain (without parser) took 12900.93ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 920.6MB). Free memory was 97.9MB in the beginning and 959.7MB in the end (delta: -861.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-01-31 17:36:45,177 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:36:45,177 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:36:45,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2112.44ms. Allocated memory was 155.2MB in the beginning and 297.8MB in the end (delta: 142.6MB). Free memory was 97.1MB in the beginning and 220.3MB in the end (delta: -123.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2024-01-31 17:36:45,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.47ms. Allocated memory is still 297.8MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:36:45,178 INFO L158 Benchmark]: Boogie Preprocessor took 75.71ms. Allocated memory is still 297.8MB. Free memory was 218.2MB in the beginning and 215.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:36:45,178 INFO L158 Benchmark]: RCFGBuilder took 562.68ms. Allocated memory is still 297.8MB. Free memory was 215.1MB in the beginning and 164.7MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-01-31 17:36:45,179 INFO L158 Benchmark]: TraceAbstraction took 10073.20ms. Allocated memory was 297.8MB in the beginning and 1.1GB in the end (delta: 778.0MB). Free memory was 163.7MB in the beginning and 959.7MB in the end (delta: -796.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:36:45,181 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2112.44ms. Allocated memory was 155.2MB in the beginning and 297.8MB in the end (delta: 142.6MB). Free memory was 97.1MB in the beginning and 220.3MB in the end (delta: -123.1MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.47ms. Allocated memory is still 297.8MB. Free memory was 220.3MB in the beginning and 218.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.71ms. Allocated memory is still 297.8MB. Free memory was 218.2MB in the beginning and 215.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.68ms. Allocated memory is still 297.8MB. Free memory was 215.1MB in the beginning and 164.7MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10073.20ms. Allocated memory was 297.8MB in the beginning and 1.1GB in the end (delta: 778.0MB). Free memory was 163.7MB in the beginning and 959.7MB in the end (delta: -796.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 839]: 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: 843]: 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 7 procedures, 70 locations, 9 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: 9.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 569 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 50 mSDtfsCounter, 1876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=613occurred in iteration=10, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 17:36:45,244 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