./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix016.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/mix016.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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:10:48,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:10:48,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:10:48,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:10:48,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:10:48,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:10:48,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:10:48,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:10:48,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:10:48,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:10:48,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:10:48,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:10:48,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:10:48,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:10:48,719 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:10:48,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:10:48,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:10:48,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:10:48,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:10:48,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:10:48,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:10:48,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:10:48,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:10:48,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:10:48,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:10:48,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:10:48,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:10:48,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:10:48,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:10:48,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:10:48,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:10:48,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:10:48,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:10:48,725 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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2024-01-27 16:10:48,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:10:48,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:10:48,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:10:48,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:10:48,957 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:10:48,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2024-01-27 16:10:49,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:10:50,202 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:10:50,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016.oepc.i [2024-01-27 16:10:50,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3adf62e5/151b19e28a564001b41a5ca99f04e50b/FLAG262062bf7 [2024-01-27 16:10:50,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3adf62e5/151b19e28a564001b41a5ca99f04e50b [2024-01-27 16:10:50,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:10:50,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:10:50,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:10:50,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:10:50,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:10:50,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@938c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50, skipping insertion in model container [2024-01-27 16:10:50,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,291 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:10:50,420 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/mix016.oepc.i[945,958] [2024-01-27 16:10:50,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:10:50,572 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:10:50,581 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/mix016.oepc.i[945,958] [2024-01-27 16:10:50,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:10:50,660 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:10:50,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50 WrapperNode [2024-01-27 16:10:50,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:10:50,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:10:50,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:10:50,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:10:50,667 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:10:50" (1/1) ... [2024-01-27 16:10:50,677 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:10:50" (1/1) ... [2024-01-27 16:10:50,703 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-01-27 16:10:50,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:10:50,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:10:50,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:10:50,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:10:50,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,727 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:10:50,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:10:50,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:10:50,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:10:50,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:10:50,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (1/1) ... [2024-01-27 16:10:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:10:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:10:50,795 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:10:50,800 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:10:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:10:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:10:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:10:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:10:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:10:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:10:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:10:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:10:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:10:50,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:10:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:10:50,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:10:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:10:50,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:10:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:10:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:10:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:10:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:10:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:10:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:10:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:10:50,839 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:10:51,024 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:10:51,028 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:10:51,279 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:10:51,279 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:10:51,418 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:10:51,420 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:10:51,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:51 BoogieIcfgContainer [2024-01-27 16:10:51,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:10:51,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:10:51,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:10:51,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:10:51,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:10:50" (1/3) ... [2024-01-27 16:10:51,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d96727d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:10:51, skipping insertion in model container [2024-01-27 16:10:51,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:10:50" (2/3) ... [2024-01-27 16:10:51,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d96727d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:10:51, skipping insertion in model container [2024-01-27 16:10:51,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:51" (3/3) ... [2024-01-27 16:10:51,433 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2024-01-27 16:10:51,439 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:10:51,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:10:51,446 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:10:51,447 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:10:51,486 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:10:51,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:10:51,540 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-01-27 16:10:51,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:10:51,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-01-27 16:10:51,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:10:51,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-01-27 16:10:51,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:10:51,560 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;@6f6b1c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:10:51,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:10:51,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:10:51,563 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-01-27 16:10:51,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:10:51,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:51,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 16:10:51,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:51,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 11354589, now seen corresponding path program 1 times [2024-01-27 16:10:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732292241] [2024-01-27 16:10:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:51,912 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:10:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732292241] [2024-01-27 16:10:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732292241] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:51,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:10:51,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153355277] [2024-01-27 16:10:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:51,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:10:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:10:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:10:51,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-01-27 16:10:51,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:10:51,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:51,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-01-27 16:10:51,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:52,205 INFO L124 PetriNetUnfolderBase]: 617/1134 cut-off events. [2024-01-27 16:10:52,205 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 16:10:52,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1134 events. 617/1134 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6702 event pairs, 199 based on Foata normal form. 45/1158 useless extension candidates. Maximal degree in co-relation 2100. Up to 763 conditions per place. [2024-01-27 16:10:52,217 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 29 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-01-27 16:10:52,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 179 flow [2024-01-27 16:10:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:10:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:10:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-01-27 16:10:52,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-01-27 16:10:52,229 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 93 transitions. [2024-01-27 16:10:52,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 179 flow [2024-01-27 16:10:52,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:10:52,235 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-01-27 16:10:52,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-01-27 16:10:52,241 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-01-27 16:10:52,242 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-01-27 16:10:52,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:10:52,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:52,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:10:52,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:52,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 66218276, now seen corresponding path program 1 times [2024-01-27 16:10:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754663518] [2024-01-27 16:10:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:52,431 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:10:52,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754663518] [2024-01-27 16:10:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754663518] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:10:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100089761] [2024-01-27 16:10:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:10:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:10:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:10:52,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:10:52,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:10:52,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:52,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:10:52,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:52,691 INFO L124 PetriNetUnfolderBase]: 1318/2354 cut-off events. [2024-01-27 16:10:52,692 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-01-27 16:10:52,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 2354 events. 1318/2354 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15172 event pairs, 188 based on Foata normal form. 100/2327 useless extension candidates. Maximal degree in co-relation 4523. Up to 1053 conditions per place. [2024-01-27 16:10:52,701 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-01-27 16:10:52,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 230 flow [2024-01-27 16:10:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:10:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:10:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-01-27 16:10:52,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-01-27 16:10:52,705 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 4 states and 109 transitions. [2024-01-27 16:10:52,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 230 flow [2024-01-27 16:10:52,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:52,708 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 108 flow [2024-01-27 16:10:52,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-01-27 16:10:52,709 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-01-27 16:10:52,709 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 108 flow [2024-01-27 16:10:52,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:10:52,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:52,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:52,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:10:52,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:52,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1785469340, now seen corresponding path program 1 times [2024-01-27 16:10:52,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944209609] [2024-01-27 16:10:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:52,928 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:10:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944209609] [2024-01-27 16:10:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944209609] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:52,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:10:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451133010] [2024-01-27 16:10:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:52,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:10:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:10:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:10:52,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:10:52,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:10:52,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:52,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:10:52,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:53,126 INFO L124 PetriNetUnfolderBase]: 886/1568 cut-off events. [2024-01-27 16:10:53,126 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-01-27 16:10:53,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 1568 events. 886/1568 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8776 event pairs, 100 based on Foata normal form. 82/1572 useless extension candidates. Maximal degree in co-relation 3533. Up to 465 conditions per place. [2024-01-27 16:10:53,132 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2024-01-27 16:10:53,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 323 flow [2024-01-27 16:10:53,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:10:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:10:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-01-27 16:10:53,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.69 [2024-01-27 16:10:53,136 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 108 flow. Second operand 5 states and 138 transitions. [2024-01-27 16:10:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 323 flow [2024-01-27 16:10:53,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:10:53,140 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 148 flow [2024-01-27 16:10:53,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-01-27 16:10:53,141 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-01-27 16:10:53,141 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 148 flow [2024-01-27 16:10:53,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:10:53,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:53,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:53,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:10:53,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:53,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash -222251869, now seen corresponding path program 1 times [2024-01-27 16:10:53,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:53,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553738337] [2024-01-27 16:10:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:53,313 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:10:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553738337] [2024-01-27 16:10:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553738337] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:10:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985864661] [2024-01-27 16:10:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:53,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:10:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:10:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:10:53,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:10:53,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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:10:53,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:53,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:10:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:53,497 INFO L124 PetriNetUnfolderBase]: 557/941 cut-off events. [2024-01-27 16:10:53,497 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-01-27 16:10:53,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 941 events. 557/941 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4347 event pairs, 83 based on Foata normal form. 40/937 useless extension candidates. Maximal degree in co-relation 2421. Up to 308 conditions per place. [2024-01-27 16:10:53,502 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-01-27 16:10:53,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 330 flow [2024-01-27 16:10:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:10:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:10:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-01-27 16:10:53,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2024-01-27 16:10:53,504 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 148 flow. Second operand 6 states and 149 transitions. [2024-01-27 16:10:53,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 330 flow [2024-01-27 16:10:53,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-27 16:10:53,511 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2024-01-27 16:10:53,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-01-27 16:10:53,512 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-01-27 16:10:53,512 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2024-01-27 16:10:53,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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:10:53,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:53,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:53,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:10:53,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:53,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1735290960, now seen corresponding path program 1 times [2024-01-27 16:10:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:53,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667737724] [2024-01-27 16:10:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:54,194 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:10:54,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:54,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667737724] [2024-01-27 16:10:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667737724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:10:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369184261] [2024-01-27 16:10:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:54,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:10:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:10:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:10:54,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-01-27 16:10:54,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:10:54,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:54,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-01-27 16:10:54,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:54,459 INFO L124 PetriNetUnfolderBase]: 470/911 cut-off events. [2024-01-27 16:10:54,459 INFO L125 PetriNetUnfolderBase]: For 531/551 co-relation queries the response was YES. [2024-01-27 16:10:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 911 events. 470/911 cut-off events. For 531/551 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4564 event pairs, 146 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 2216. Up to 430 conditions per place. [2024-01-27 16:10:54,462 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 27 selfloop transitions, 6 changer transitions 29/82 dead transitions. [2024-01-27 16:10:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 388 flow [2024-01-27 16:10:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:10:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:10:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-01-27 16:10:54,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-01-27 16:10:54,464 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 9 states and 216 transitions. [2024-01-27 16:10:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 388 flow [2024-01-27 16:10:54,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 324 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-01-27 16:10:54,467 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 151 flow [2024-01-27 16:10:54,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-01-27 16:10:54,468 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2024-01-27 16:10:54,468 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 151 flow [2024-01-27 16:10:54,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:10:54,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:54,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:54,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:10:54,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:54,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 230151376, now seen corresponding path program 2 times [2024-01-27 16:10:54,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248150593] [2024-01-27 16:10:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:54,630 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:10:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:54,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248150593] [2024-01-27 16:10:54,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248150593] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:54,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:54,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:10:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115306310] [2024-01-27 16:10:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:54,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:10:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:10:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:10:54,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-01-27 16:10:54,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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:10:54,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:54,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-01-27 16:10:54,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:54,896 INFO L124 PetriNetUnfolderBase]: 933/1641 cut-off events. [2024-01-27 16:10:54,896 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2024-01-27 16:10:54,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3754 conditions, 1641 events. 933/1641 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8734 event pairs, 103 based on Foata normal form. 8/1609 useless extension candidates. Maximal degree in co-relation 3737. Up to 658 conditions per place. [2024-01-27 16:10:54,902 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 42 selfloop transitions, 4 changer transitions 33/95 dead transitions. [2024-01-27 16:10:54,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 465 flow [2024-01-27 16:10:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:10:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:10:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-01-27 16:10:54,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-01-27 16:10:54,903 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 151 flow. Second operand 8 states and 172 transitions. [2024-01-27 16:10:54,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 465 flow [2024-01-27 16:10:54,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 451 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-01-27 16:10:54,905 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 177 flow [2024-01-27 16:10:54,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2024-01-27 16:10:54,907 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2024-01-27 16:10:54,907 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 177 flow [2024-01-27 16:10:54,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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:10:54,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:54,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:54,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:10:54,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:54,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 159862028, now seen corresponding path program 3 times [2024-01-27 16:10:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:54,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902818583] [2024-01-27 16:10:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:10:55,402 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:10:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:10:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902818583] [2024-01-27 16:10:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902818583] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:10:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:10:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:10:55,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845626694] [2024-01-27 16:10:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:10:55,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:10:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:10:55,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:10:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:10:55,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-01-27 16:10:55,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 177 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:10:55,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:10:55,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-01-27 16:10:55,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:10:55,719 INFO L124 PetriNetUnfolderBase]: 627/1231 cut-off events. [2024-01-27 16:10:55,720 INFO L125 PetriNetUnfolderBase]: For 248/306 co-relation queries the response was YES. [2024-01-27 16:10:55,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 1231 events. 627/1231 cut-off events. For 248/306 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6728 event pairs, 155 based on Foata normal form. 19/1187 useless extension candidates. Maximal degree in co-relation 2777. Up to 470 conditions per place. [2024-01-27 16:10:55,725 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 40 selfloop transitions, 18 changer transitions 21/101 dead transitions. [2024-01-27 16:10:55,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 477 flow [2024-01-27 16:10:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:10:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:10:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-01-27 16:10:55,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615 [2024-01-27 16:10:55,726 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 177 flow. Second operand 10 states and 246 transitions. [2024-01-27 16:10:55,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 477 flow [2024-01-27 16:10:55,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 467 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 16:10:55,730 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 276 flow [2024-01-27 16:10:55,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-01-27 16:10:55,731 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2024-01-27 16:10:55,731 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 276 flow [2024-01-27 16:10:55,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:10:55,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:10:55,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:10:55,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:10:55,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:10:55,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:10:55,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1063594162, now seen corresponding path program 4 times [2024-01-27 16:10:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:10:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112829504] [2024-01-27 16:10:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:10:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:10:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:55,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:10:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:10:55,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:10:55,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:10:55,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:10:55,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:10:55,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:10:55,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:10:55,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:10:55,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:10:55,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:10:55,830 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-01-27 16:10:55,834 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:10:55,834 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:10:55,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:10:55 BasicIcfg [2024-01-27 16:10:55,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:10:55,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:10:55,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:10:55,917 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:10:55,917 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:10:51" (3/4) ... [2024-01-27 16:10:55,918 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:10:56,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:10:56,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:10:56,001 INFO L158 Benchmark]: Toolchain (without parser) took 5757.16ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 105.3MB in the beginning and 174.7MB in the end (delta: -69.4MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,001 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 116.0MB in the end (delta: 159.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:10:56,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.16ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 80.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,002 INFO L158 Benchmark]: Boogie Preprocessor took 56.90ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,003 INFO L158 Benchmark]: RCFGBuilder took 664.18ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 72.7MB in the end (delta: 2.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,003 INFO L158 Benchmark]: TraceAbstraction took 4489.07ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 72.0MB in the beginning and 187.3MB in the end (delta: -115.3MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,003 INFO L158 Benchmark]: Witness Printer took 84.09ms. Allocated memory is still 312.5MB. Free memory was 187.3MB in the beginning and 174.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:10:56,006 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.13ms. Allocated memory is still 142.6MB. Free memory was 116.2MB in the beginning and 116.0MB in the end (delta: 159.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.16ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 80.9MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.90ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 664.18ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 72.7MB in the end (delta: 2.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4489.07ms. Allocated memory was 142.6MB in the beginning and 312.5MB in the end (delta: 169.9MB). Free memory was 72.0MB in the beginning and 187.3MB in the end (delta: -115.3MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 84.09ms. Allocated memory is still 312.5MB. Free memory was 187.3MB in the beginning and 174.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 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: 4.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1130 IncrementalHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 8 mSDtfsCounter, 1130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:10:56,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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