./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:16:03,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:16:03,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:16:03,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:16:03,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:16:03,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:16:03,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:16:03,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:16:03,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:16:03,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:16:03,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:16:03,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:16:03,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:16:03,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:16:03,938 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:16:03,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:16:03,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:16:03,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:16:03,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:16:03,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:16:03,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:16:03,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:16:03,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:16:03,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:16:03,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:16:03,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:16:03,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:16:03,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:16:03,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:16:03,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:16:03,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:16:03,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:16:03,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:03,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:16:03,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:16:03,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:16:03,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:16:03,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:16:03,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:16:03,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:16:03,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:16:03,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:16:03,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:16:03,947 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 449d00de99d52e6ea9aa539e57f46adfc8dfbb78972c0dc655f91843e743f43f [2024-01-27 16:16:04,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:16:04,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:16:04,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:16:04,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:16:04,254 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:16:04,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2024-01-27 16:16:05,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:16:05,769 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:16:05,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.oepc.i [2024-01-27 16:16:05,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b0d28d4/84ddeaf7fa444ed9b950a317669a2256/FLAG52167793e [2024-01-27 16:16:05,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b0d28d4/84ddeaf7fa444ed9b950a317669a2256 [2024-01-27 16:16:05,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:16:05,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:16:05,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:05,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:16:05,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:16:05,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:05" (1/1) ... [2024-01-27 16:16:05,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1695a1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:05, skipping insertion in model container [2024-01-27 16:16:05,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:16:05" (1/1) ... [2024-01-27 16:16:05,859 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:16:06,005 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/safe018_power.oepc.i[995,1008] [2024-01-27 16:16:06,264 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:06,280 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:16:06,294 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/safe018_power.oepc.i[995,1008] [2024-01-27 16:16:06,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:16:06,419 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:16:06,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06 WrapperNode [2024-01-27 16:16:06,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:16:06,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:06,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:16:06,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:16:06,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,505 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2024-01-27 16:16:06,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:16:06,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:16:06,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:16:06,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:16:06,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,575 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 1, 15, 1, 1]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 8 writes are split as follows [0, 1, 5, 1, 1]. [2024-01-27 16:16:06,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:16:06,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:16:06,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:16:06,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:16:06,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (1/1) ... [2024-01-27 16:16:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:16:06,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:16:06,654 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-27 16:16:06,677 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-27 16:16:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:16:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:16:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:16:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:16:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:16:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:16:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:16:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:16:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:16:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:16:06,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:16:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:16:06,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:16:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:16:06,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:16:06,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:16:06,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:16:06,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:16:06,714 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:16:06,875 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:16:06,878 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:16:07,284 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:16:07,284 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:16:07,626 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:16:07,627 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:16:07,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:07 BoogieIcfgContainer [2024-01-27 16:16:07,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:16:07,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:16:07,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:16:07,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:16:07,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:16:05" (1/3) ... [2024-01-27 16:16:07,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13929ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:07, skipping insertion in model container [2024-01-27 16:16:07,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:16:06" (2/3) ... [2024-01-27 16:16:07,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13929ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:16:07, skipping insertion in model container [2024-01-27 16:16:07,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:07" (3/3) ... [2024-01-27 16:16:07,637 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.oepc.i [2024-01-27 16:16:07,647 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:16:07,655 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:16:07,655 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:16:07,655 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:16:07,712 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:16:07,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 86 flow [2024-01-27 16:16:07,783 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-01-27 16:16:07,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:16:07,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-01-27 16:16:07,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 37 transitions, 86 flow [2024-01-27 16:16:07,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-01-27 16:16:07,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:16:07,813 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2ef9161e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:16:07,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 16:16:07,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:16:07,830 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-01-27 16:16:07,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:16:07,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:07,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:07,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 16:16:07,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 487068830, now seen corresponding path program 1 times [2024-01-27 16:16:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777359134] [2024-01-27 16:16:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:08,490 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-27 16:16:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777359134] [2024-01-27 16:16:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777359134] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:16:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269439727] [2024-01-27 16:16:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:08,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:08,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-01-27 16:16:08,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-27 16:16:08,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:08,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-01-27 16:16:08,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:09,008 INFO L124 PetriNetUnfolderBase]: 901/1505 cut-off events. [2024-01-27 16:16:09,009 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 16:16:09,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1505 events. 901/1505 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8483 event pairs, 96 based on Foata normal form. 60/1555 useless extension candidates. Maximal degree in co-relation 2917. Up to 846 conditions per place. [2024-01-27 16:16:09,024 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 36 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2024-01-27 16:16:09,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 203 flow [2024-01-27 16:16:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-01-27 16:16:09,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-01-27 16:16:09,038 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 4 states and 100 transitions. [2024-01-27 16:16:09,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 203 flow [2024-01-27 16:16:09,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:16:09,044 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 102 flow [2024-01-27 16:16:09,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-01-27 16:16:09,050 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-01-27 16:16:09,050 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 102 flow [2024-01-27 16:16:09,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-27 16:16:09,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:09,051 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-27 16:16:09,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:16:09,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 16:16:09,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -881160740, now seen corresponding path program 1 times [2024-01-27 16:16:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968390064] [2024-01-27 16:16:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:09,287 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-27 16:16:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968390064] [2024-01-27 16:16:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968390064] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:09,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:09,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:09,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129252992] [2024-01-27 16:16:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:16:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:16:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:16:09,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-01-27 16:16:09,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-27 16:16:09,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:09,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-01-27 16:16:09,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:09,589 INFO L124 PetriNetUnfolderBase]: 630/1074 cut-off events. [2024-01-27 16:16:09,589 INFO L125 PetriNetUnfolderBase]: For 314/318 co-relation queries the response was YES. [2024-01-27 16:16:09,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2519 conditions, 1074 events. 630/1074 cut-off events. For 314/318 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5354 event pairs, 36 based on Foata normal form. 56/1122 useless extension candidates. Maximal degree in co-relation 2507. Up to 461 conditions per place. [2024-01-27 16:16:09,598 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 45 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2024-01-27 16:16:09,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 291 flow [2024-01-27 16:16:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:16:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:16:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-01-27 16:16:09,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2024-01-27 16:16:09,604 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 102 flow. Second operand 5 states and 126 transitions. [2024-01-27 16:16:09,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 291 flow [2024-01-27 16:16:09,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 281 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:09,613 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 142 flow [2024-01-27 16:16:09,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-01-27 16:16:09,614 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2024-01-27 16:16:09,614 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 142 flow [2024-01-27 16:16:09,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-27 16:16:09,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:09,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:16:09,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 16:16:09,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2037953166, now seen corresponding path program 1 times [2024-01-27 16:16:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885929995] [2024-01-27 16:16:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:09,945 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-27 16:16:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885929995] [2024-01-27 16:16:09,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885929995] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:09,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:16:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414658161] [2024-01-27 16:16:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:16:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:16:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:16:09,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2024-01-27 16:16:09,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-27 16:16:09,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:09,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2024-01-27 16:16:09,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:10,187 INFO L124 PetriNetUnfolderBase]: 359/613 cut-off events. [2024-01-27 16:16:10,188 INFO L125 PetriNetUnfolderBase]: For 574/582 co-relation queries the response was YES. [2024-01-27 16:16:10,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 613 events. 359/613 cut-off events. For 574/582 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2488 event pairs, 25 based on Foata normal form. 36/641 useless extension candidates. Maximal degree in co-relation 1643. Up to 228 conditions per place. [2024-01-27 16:16:10,192 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 40 selfloop transitions, 11 changer transitions 1/62 dead transitions. [2024-01-27 16:16:10,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 306 flow [2024-01-27 16:16:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:16:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:16:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-01-27 16:16:10,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2024-01-27 16:16:10,196 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 142 flow. Second operand 6 states and 138 transitions. [2024-01-27 16:16:10,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 306 flow [2024-01-27 16:16:10,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 281 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-27 16:16:10,204 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 156 flow [2024-01-27 16:16:10,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-01-27 16:16:10,205 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-01-27 16:16:10,205 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 156 flow [2024-01-27 16:16:10,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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-27 16:16:10,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:10,206 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] [2024-01-27 16:16:10,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:16:10,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 16:16:10,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1622169445, now seen corresponding path program 1 times [2024-01-27 16:16:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343304444] [2024-01-27 16:16:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:11,021 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-27 16:16:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343304444] [2024-01-27 16:16:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343304444] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:11,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:16:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40530986] [2024-01-27 16:16:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:11,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:16:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:16:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:16:11,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-01-27 16:16:11,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 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-27 16:16:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-01-27 16:16:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:11,368 INFO L124 PetriNetUnfolderBase]: 530/1034 cut-off events. [2024-01-27 16:16:11,369 INFO L125 PetriNetUnfolderBase]: For 675/699 co-relation queries the response was YES. [2024-01-27 16:16:11,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 1034 events. 530/1034 cut-off events. For 675/699 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5568 event pairs, 162 based on Foata normal form. 8/996 useless extension candidates. Maximal degree in co-relation 2536. Up to 362 conditions per place. [2024-01-27 16:16:11,374 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 25 selfloop transitions, 2 changer transitions 27/71 dead transitions. [2024-01-27 16:16:11,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 352 flow [2024-01-27 16:16:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:16:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:16:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2024-01-27 16:16:11,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5912162162162162 [2024-01-27 16:16:11,376 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 156 flow. Second operand 8 states and 175 transitions. [2024-01-27 16:16:11,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 352 flow [2024-01-27 16:16:11,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 280 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-01-27 16:16:11,382 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 117 flow [2024-01-27 16:16:11,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=8, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2024-01-27 16:16:11,382 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2024-01-27 16:16:11,383 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 117 flow [2024-01-27 16:16:11,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 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-27 16:16:11,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:11,383 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] [2024-01-27 16:16:11,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:16:11,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 16:16:11,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1662686955, now seen corresponding path program 2 times [2024-01-27 16:16:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294971854] [2024-01-27 16:16:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:11,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:16:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:11,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:16:11,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:16:11,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-01-27 16:16:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-01-27 16:16:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-01-27 16:16:11,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-01-27 16:16:11,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:16:11,587 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-01-27 16:16:11,591 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:16:11,591 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:16:11,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:16:11 BasicIcfg [2024-01-27 16:16:11,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:16:11,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:16:11,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:16:11,686 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:16:11,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:16:07" (3/4) ... [2024-01-27 16:16:11,687 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:16:11,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:16:11,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:16:11,774 INFO L158 Benchmark]: Toolchain (without parser) took 5964.74ms. Allocated memory was 199.2MB in the beginning and 327.2MB in the end (delta: 127.9MB). Free memory was 128.3MB in the beginning and 261.7MB in the end (delta: -133.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:16:11,774 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:16:11,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.13ms. Allocated memory is still 199.2MB. Free memory was 128.3MB in the beginning and 103.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.49ms. Allocated memory is still 199.2MB. Free memory was 103.9MB in the beginning and 101.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,775 INFO L158 Benchmark]: Boogie Preprocessor took 112.32ms. Allocated memory is still 199.2MB. Free memory was 101.5MB in the beginning and 97.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,775 INFO L158 Benchmark]: RCFGBuilder took 1008.79ms. Allocated memory is still 199.2MB. Free memory was 97.3MB in the beginning and 115.8MB in the end (delta: -18.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,776 INFO L158 Benchmark]: TraceAbstraction took 4055.74ms. Allocated memory was 199.2MB in the beginning and 327.2MB in the end (delta: 127.9MB). Free memory was 115.8MB in the beginning and 279.5MB in the end (delta: -163.7MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,776 INFO L158 Benchmark]: Witness Printer took 87.57ms. Allocated memory is still 327.2MB. Free memory was 279.5MB in the beginning and 261.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:16:11,778 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.13ms. Allocated memory is still 199.2MB. Free memory was 128.3MB in the beginning and 103.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.49ms. Allocated memory is still 199.2MB. Free memory was 103.9MB in the beginning and 101.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.32ms. Allocated memory is still 199.2MB. Free memory was 101.5MB in the beginning and 97.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1008.79ms. Allocated memory is still 199.2MB. Free memory was 97.3MB in the beginning and 115.8MB in the end (delta: -18.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4055.74ms. Allocated memory was 199.2MB in the beginning and 327.2MB in the end (delta: 127.9MB). Free memory was 115.8MB in the beginning and 279.5MB in the end (delta: -163.7MB). Peak memory consumption was 111.0MB. Max. memory is 16.1GB. * Witness Printer took 87.57ms. Allocated memory is still 327.2MB. Free memory was 279.5MB in the beginning and 261.7MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L832] 0 pthread_t t2201; [L833] FCALL, FORK 0 pthread_create(&t2201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L834] 0 pthread_t t2202; [L835] FCALL, FORK 0 pthread_create(&t2202, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={6:0}, t2202={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 0 pthread_t t2203; [L837] FCALL, FORK 0 pthread_create(&t2203, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2201={6:0}, t2202={7:0}, t2203={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 \read(y) [L810] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2201={6:0}, t2202={7:0}, t2203={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L841] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L841] RET 0 assume_abort_if_not(main$tmp_guard0) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 \read(y) [L843] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2201={6:0}, t2202={7:0}, t2203={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L850] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L851] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L851] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2201={6:0}, t2202={7:0}, t2203={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 833]: 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: 837]: 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: 835]: 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, 60 locations, 4 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: 3.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 16 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-27 16:16:11,809 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