./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix007.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/mix007.opt.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 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:09:11,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:09:12,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:09:12,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:09:12,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:09:12,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:09:12,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:09:12,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:09:12,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:09:12,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:09:12,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:09:12,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:09:12,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:09:12,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:09:12,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:09:12,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:09:12,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:09:12,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:09:12,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:09:12,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:09:12,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:09:12,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:09:12,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:09:12,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:09:12,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:09:12,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:09:12,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:09:12,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:09:12,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:09:12,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:09:12,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:09:12,107 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 -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2024-11-16 19:09:12,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:09:12,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:09:12,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:09:12,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:09:12,333 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:09:12,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix007.opt.i [2024-11-16 19:09:13,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:09:14,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:09:14,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix007.opt.i [2024-11-16 19:09:14,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08541dd4/f08fce47ca6c4e55813b098224ca4eb8/FLAGdd3d3f5d8 [2024-11-16 19:09:14,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08541dd4/f08fce47ca6c4e55813b098224ca4eb8 [2024-11-16 19:09:14,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:09:14,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:09:14,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:09:14,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:09:14,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:09:14,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fef6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14, skipping insertion in model container [2024-11-16 19:09:14,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:09:14,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2024-11-16 19:09:14,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:09:14,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:09:14,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2024-11-16 19:09:14,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:09:14,618 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:09:14,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14 WrapperNode [2024-11-16 19:09:14,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:09:14,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:09:14,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:09:14,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:09:14,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,680 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-11-16 19:09:14,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:09:14,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:09:14,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:09:14,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:09:14,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,715 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:09:14,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:09:14,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:09:14,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:09:14,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:09:14,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (1/1) ... [2024-11-16 19:09:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:09:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:09:14,776 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-11-16 19:09:14,784 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-11-16 19:09:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:09:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:09:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:09:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:09:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:09:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:09:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:09:14,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:09:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-16 19:09:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-16 19:09:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:09:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:09:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:09:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:09:14,832 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:09:15,008 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:09:15,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:09:15,302 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:09:15,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:09:15,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:09:15,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:09:15,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:15 BoogieIcfgContainer [2024-11-16 19:09:15,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:09:15,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:09:15,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:09:15,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:09:15,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:09:14" (1/3) ... [2024-11-16 19:09:15,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10428889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:09:15, skipping insertion in model container [2024-11-16 19:09:15,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:09:14" (2/3) ... [2024-11-16 19:09:15,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10428889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:09:15, skipping insertion in model container [2024-11-16 19:09:15,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:15" (3/3) ... [2024-11-16 19:09:15,481 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2024-11-16 19:09:15,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:09:15,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:09:15,495 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:09:15,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:09:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-11-16 19:09:15,588 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-16 19:09:15,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:09:15,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-11-16 19:09:15,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-11-16 19:09:15,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-11-16 19:09:15,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:09:15,606 INFO L333 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, 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;@77eb696e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:09:15,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-16 19:09:15,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:09:15,613 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-16 19:09:15,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:09:15,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:15,614 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:15,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:15,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1227400286, now seen corresponding path program 1 times [2024-11-16 19:09:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76793552] [2024-11-16 19:09:15,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76793552] [2024-11-16 19:09:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76793552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:09:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369917034] [2024-11-16 19:09:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:09:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:09:16,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:09:16,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:16,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-16 19:09:16,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:16,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:16,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:21,603 INFO L124 PetriNetUnfolderBase]: 53315/70323 cut-off events. [2024-11-16 19:09:21,604 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-11-16 19:09:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140699 conditions, 70323 events. 53315/70323 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 1971. Compared 409034 event pairs, 6875 based on Foata normal form. 1764/72051 useless extension candidates. Maximal degree in co-relation 140687. Up to 60049 conditions per place. [2024-11-16 19:09:21,959 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 58 selfloop transitions, 2 changer transitions 2/68 dead transitions. [2024-11-16 19:09:21,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 272 flow [2024-11-16 19:09:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:09:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:09:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-11-16 19:09:21,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-16 19:09:21,973 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 95 transitions. [2024-11-16 19:09:21,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 272 flow [2024-11-16 19:09:21,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 19:09:21,985 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-11-16 19:09:21,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-16 19:09:21,993 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-11-16 19:09:21,993 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-11-16 19:09:21,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11-16 19:09:21,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:21,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:21,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:09:21,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:21,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1528957798, now seen corresponding path program 1 times [2024-11-16 19:09:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993375205] [2024-11-16 19:09:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993375205] [2024-11-16 19:09:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993375205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:09:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433625700] [2024-11-16 19:09:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:09:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:09:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:09:22,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:22,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-11-16 19:09:22,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:22,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:22,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:25,840 INFO L124 PetriNetUnfolderBase]: 42351/59177 cut-off events. [2024-11-16 19:09:25,841 INFO L125 PetriNetUnfolderBase]: For 1788/1788 co-relation queries the response was YES. [2024-11-16 19:09:25,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117975 conditions, 59177 events. 42351/59177 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 384286 event pairs, 5317 based on Foata normal form. 1764/60916 useless extension candidates. Maximal degree in co-relation 117965. Up to 34369 conditions per place. [2024-11-16 19:09:26,128 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 78 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2024-11-16 19:09:26,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 374 flow [2024-11-16 19:09:26,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:09:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:09:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-16 19:09:26,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.635 [2024-11-16 19:09:26,133 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 127 transitions. [2024-11-16 19:09:26,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 374 flow [2024-11-16 19:09:26,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:09:26,143 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-11-16 19:09:26,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-11-16 19:09:26,144 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-11-16 19:09:26,144 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-11-16 19:09:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-11-16 19:09:26,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:26,145 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:26,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:09:26,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:26,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1032282409, now seen corresponding path program 1 times [2024-11-16 19:09:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432624360] [2024-11-16 19:09:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432624360] [2024-11-16 19:09:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432624360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:09:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338031842] [2024-11-16 19:09:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:09:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:09:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:09:26,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:26,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:26,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:26,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:26,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:29,048 INFO L124 PetriNetUnfolderBase]: 26351/37017 cut-off events. [2024-11-16 19:09:29,048 INFO L125 PetriNetUnfolderBase]: For 7118/7118 co-relation queries the response was YES. [2024-11-16 19:09:29,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82845 conditions, 37017 events. 26351/37017 cut-off events. For 7118/7118 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 224450 event pairs, 3159 based on Foata normal form. 1364/38356 useless extension candidates. Maximal degree in co-relation 82833. Up to 14929 conditions per place. [2024-11-16 19:09:29,209 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 101 selfloop transitions, 10 changer transitions 1/118 dead transitions. [2024-11-16 19:09:29,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 531 flow [2024-11-16 19:09:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:09:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:09:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-16 19:09:29,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.656 [2024-11-16 19:09:29,212 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 164 transitions. [2024-11-16 19:09:29,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 531 flow [2024-11-16 19:09:29,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 520 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-16 19:09:29,221 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-11-16 19:09:29,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-11-16 19:09:29,222 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-11-16 19:09:29,222 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-11-16 19:09:29,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:29,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:29,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:09:29,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1727647704, now seen corresponding path program 1 times [2024-11-16 19:09:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198923059] [2024-11-16 19:09:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198923059] [2024-11-16 19:09:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198923059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:09:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84412400] [2024-11-16 19:09:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:29,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:09:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:09:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:09:29,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:29,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:29,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:29,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:29,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:30,575 INFO L124 PetriNetUnfolderBase]: 15603/21677 cut-off events. [2024-11-16 19:09:30,576 INFO L125 PetriNetUnfolderBase]: For 13130/13130 co-relation queries the response was YES. [2024-11-16 19:09:30,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53077 conditions, 21677 events. 15603/21677 cut-off events. For 13130/13130 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 117579 event pairs, 2769 based on Foata normal form. 644/22296 useless extension candidates. Maximal degree in co-relation 53063. Up to 6400 conditions per place. [2024-11-16 19:09:30,664 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 122 selfloop transitions, 14 changer transitions 1/143 dead transitions. [2024-11-16 19:09:30,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 694 flow [2024-11-16 19:09:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:09:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:09:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-16 19:09:30,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2024-11-16 19:09:30,666 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 199 transitions. [2024-11-16 19:09:30,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 694 flow [2024-11-16 19:09:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 143 transitions, 664 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-16 19:09:30,821 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-11-16 19:09:30,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-16 19:09:30,822 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-11-16 19:09:30,822 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-11-16 19:09:30,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:30,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:30,822 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:30,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:09:30,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:30,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -523337621, now seen corresponding path program 1 times [2024-11-16 19:09:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170851877] [2024-11-16 19:09:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170851877] [2024-11-16 19:09:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170851877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:09:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509070267] [2024-11-16 19:09:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:31,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:09:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:09:31,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:09:31,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-11-16 19:09:31,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:31,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:32,315 INFO L124 PetriNetUnfolderBase]: 12135/16573 cut-off events. [2024-11-16 19:09:32,316 INFO L125 PetriNetUnfolderBase]: For 12214/12214 co-relation queries the response was YES. [2024-11-16 19:09:32,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41966 conditions, 16573 events. 12135/16573 cut-off events. For 12214/12214 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 86297 event pairs, 2575 based on Foata normal form. 160/16708 useless extension candidates. Maximal degree in co-relation 41951. Up to 6400 conditions per place. [2024-11-16 19:09:32,420 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 105 selfloop transitions, 18 changer transitions 1/130 dead transitions. [2024-11-16 19:09:32,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 130 transitions, 652 flow [2024-11-16 19:09:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:09:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:09:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2024-11-16 19:09:32,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56 [2024-11-16 19:09:32,422 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 196 transitions. [2024-11-16 19:09:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 130 transitions, 652 flow [2024-11-16 19:09:32,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 606 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-16 19:09:32,661 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-11-16 19:09:32,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-16 19:09:32,661 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-11-16 19:09:32,662 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-11-16 19:09:32,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-11-16 19:09:32,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:32,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:32,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:09:32,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:32,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2114398449, now seen corresponding path program 1 times [2024-11-16 19:09:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:32,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390393005] [2024-11-16 19:09:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:33,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390393005] [2024-11-16 19:09:33,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390393005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:33,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:33,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:09:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95711879] [2024-11-16 19:09:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:09:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:09:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:09:33,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:33,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:33,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:33,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:33,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:35,278 INFO L124 PetriNetUnfolderBase]: 23543/32215 cut-off events. [2024-11-16 19:09:35,280 INFO L125 PetriNetUnfolderBase]: For 25368/25368 co-relation queries the response was YES. [2024-11-16 19:09:35,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82721 conditions, 32215 events. 23543/32215 cut-off events. For 25368/25368 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 185350 event pairs, 3891 based on Foata normal form. 32/32244 useless extension candidates. Maximal degree in co-relation 82705. Up to 13981 conditions per place. [2024-11-16 19:09:35,503 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 81 selfloop transitions, 6 changer transitions 72/165 dead transitions. [2024-11-16 19:09:35,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 165 transitions, 1050 flow [2024-11-16 19:09:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:09:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:09:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-11-16 19:09:35,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-11-16 19:09:35,505 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 9 states and 215 transitions. [2024-11-16 19:09:35,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 165 transitions, 1050 flow [2024-11-16 19:09:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 768 flow, removed 51 selfloop flow, removed 10 redundant places. [2024-11-16 19:09:36,047 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 195 flow [2024-11-16 19:09:36,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-11-16 19:09:36,048 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2024-11-16 19:09:36,048 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 195 flow [2024-11-16 19:09:36,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:36,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:36,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:09:36,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2001626579, now seen corresponding path program 2 times [2024-11-16 19:09:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144094554] [2024-11-16 19:09:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:36,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:36,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144094554] [2024-11-16 19:09:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144094554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:09:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147478519] [2024-11-16 19:09:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:36,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:09:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:09:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:09:36,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:36,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-11-16 19:09:36,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:36,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:37,600 INFO L124 PetriNetUnfolderBase]: 11999/16603 cut-off events. [2024-11-16 19:09:37,600 INFO L125 PetriNetUnfolderBase]: For 4149/4149 co-relation queries the response was YES. [2024-11-16 19:09:37,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40143 conditions, 16603 events. 11999/16603 cut-off events. For 4149/4149 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 85138 event pairs, 2157 based on Foata normal form. 16/16616 useless extension candidates. Maximal degree in co-relation 40125. Up to 10162 conditions per place. [2024-11-16 19:09:37,685 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 120 selfloop transitions, 17 changer transitions 17/160 dead transitions. [2024-11-16 19:09:37,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 160 transitions, 822 flow [2024-11-16 19:09:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:09:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:09:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-11-16 19:09:37,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-11-16 19:09:37,687 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 195 flow. Second operand 7 states and 189 transitions. [2024-11-16 19:09:37,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 160 transitions, 822 flow [2024-11-16 19:09:37,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 160 transitions, 787 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-11-16 19:09:37,694 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 308 flow [2024-11-16 19:09:37,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-11-16 19:09:37,694 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2024-11-16 19:09:37,695 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 308 flow [2024-11-16 19:09:37,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-11-16 19:09:37,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:37,695 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:37,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:09:37,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 610794285, now seen corresponding path program 3 times [2024-11-16 19:09:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715032961] [2024-11-16 19:09:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715032961] [2024-11-16 19:09:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715032961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:37,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:09:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951106573] [2024-11-16 19:09:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:09:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:09:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:09:37,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:37,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-11-16 19:09:37,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:37,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:40,146 INFO L124 PetriNetUnfolderBase]: 19313/26745 cut-off events. [2024-11-16 19:09:40,147 INFO L125 PetriNetUnfolderBase]: For 17980/17980 co-relation queries the response was YES. [2024-11-16 19:09:40,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71224 conditions, 26745 events. 19313/26745 cut-off events. For 17980/17980 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 146308 event pairs, 5863 based on Foata normal form. 16/26757 useless extension candidates. Maximal degree in co-relation 71205. Up to 14476 conditions per place. [2024-11-16 19:09:40,283 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 76 selfloop transitions, 1 changer transitions 67/150 dead transitions. [2024-11-16 19:09:40,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 150 transitions, 912 flow [2024-11-16 19:09:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:09:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:09:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-16 19:09:40,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2024-11-16 19:09:40,286 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 308 flow. Second operand 6 states and 151 transitions. [2024-11-16 19:09:40,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 150 transitions, 912 flow [2024-11-16 19:09:40,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 150 transitions, 906 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-16 19:09:40,295 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 288 flow [2024-11-16 19:09:40,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2024-11-16 19:09:40,297 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2024-11-16 19:09:40,297 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 288 flow [2024-11-16 19:09:40,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-11-16 19:09:40,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:40,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:09:40,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1028641373, now seen corresponding path program 4 times [2024-11-16 19:09:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081534731] [2024-11-16 19:09:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081534731] [2024-11-16 19:09:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081534731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:09:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970512021] [2024-11-16 19:09:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:09:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:09:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:09:40,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:40,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:40,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:40,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:40,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:41,928 INFO L124 PetriNetUnfolderBase]: 11705/16572 cut-off events. [2024-11-16 19:09:41,929 INFO L125 PetriNetUnfolderBase]: For 8282/8282 co-relation queries the response was YES. [2024-11-16 19:09:41,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42226 conditions, 16572 events. 11705/16572 cut-off events. For 8282/8282 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 87773 event pairs, 2361 based on Foata normal form. 16/16586 useless extension candidates. Maximal degree in co-relation 42204. Up to 8216 conditions per place. [2024-11-16 19:09:41,998 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 65 selfloop transitions, 5 changer transitions 72/148 dead transitions. [2024-11-16 19:09:41,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 148 transitions, 839 flow [2024-11-16 19:09:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:09:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:09:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-11-16 19:09:42,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4725 [2024-11-16 19:09:42,000 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 288 flow. Second operand 8 states and 189 transitions. [2024-11-16 19:09:42,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 148 transitions, 839 flow [2024-11-16 19:09:42,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 148 transitions, 824 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-16 19:09:42,005 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 217 flow [2024-11-16 19:09:42,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2024-11-16 19:09:42,008 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2024-11-16 19:09:42,008 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 55 transitions, 217 flow [2024-11-16 19:09:42,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:42,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:42,009 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:42,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:09:42,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1504601983, now seen corresponding path program 5 times [2024-11-16 19:09:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113121776] [2024-11-16 19:09:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:09:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113121776] [2024-11-16 19:09:43,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113121776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:43,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:43,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:09:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912521878] [2024-11-16 19:09:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:43,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:09:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:09:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:09:43,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-11-16 19:09:43,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 55 transitions, 217 flow. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:43,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:43,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-11-16 19:09:43,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:44,091 INFO L124 PetriNetUnfolderBase]: 4899/7148 cut-off events. [2024-11-16 19:09:44,092 INFO L125 PetriNetUnfolderBase]: For 3990/3990 co-relation queries the response was YES. [2024-11-16 19:09:44,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17804 conditions, 7148 events. 4899/7148 cut-off events. For 3990/3990 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 34919 event pairs, 765 based on Foata normal form. 16/7163 useless extension candidates. Maximal degree in co-relation 17780. Up to 2929 conditions per place. [2024-11-16 19:09:44,114 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 56 selfloop transitions, 4 changer transitions 66/132 dead transitions. [2024-11-16 19:09:44,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 727 flow [2024-11-16 19:09:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:09:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:09:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions. [2024-11-16 19:09:44,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39 [2024-11-16 19:09:44,115 INFO L175 Difference]: Start difference. First operand has 81 places, 55 transitions, 217 flow. Second operand 10 states and 195 transitions. [2024-11-16 19:09:44,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 727 flow [2024-11-16 19:09:44,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 657 flow, removed 16 selfloop flow, removed 14 redundant places. [2024-11-16 19:09:44,123 INFO L231 Difference]: Finished difference. Result has 78 places, 55 transitions, 193 flow [2024-11-16 19:09:44,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=193, PETRI_PLACES=78, PETRI_TRANSITIONS=55} [2024-11-16 19:09:44,127 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2024-11-16 19:09:44,127 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 55 transitions, 193 flow [2024-11-16 19:09:44,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:44,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:44,128 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:09:44,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-16 19:09:44,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash 396956515, now seen corresponding path program 6 times [2024-11-16 19:09:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561963277] [2024-11-16 19:09:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:09:44,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:09:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:09:44,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:09:44,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:09:44,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-16 19:09:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-16 19:09:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-16 19:09:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-16 19:09:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-16 19:09:44,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-16 19:09:44,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-16 19:09:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:09:44,273 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-16 19:09:44,371 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:09:44,372 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:09:44,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:09:44 BasicIcfg [2024-11-16 19:09:44,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:09:44,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:09:44,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:09:44,377 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:09:44,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:09:15" (3/4) ... [2024-11-16 19:09:44,378 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:09:44,455 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:09:44,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:09:44,457 INFO L158 Benchmark]: Toolchain (without parser) took 30341.91ms. Allocated memory was 247.5MB in the beginning and 10.2GB in the end (delta: 9.9GB). Free memory was 176.0MB in the beginning and 9.0GB in the end (delta: -8.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-16 19:09:44,457 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:09:44,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 247.5MB. Free memory was 175.7MB in the beginning and 148.7MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 19:09:44,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.36ms. Allocated memory is still 247.5MB. Free memory was 148.7MB in the beginning and 145.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:09:44,458 INFO L158 Benchmark]: Boogie Preprocessor took 47.32ms. Allocated memory is still 247.5MB. Free memory was 145.7MB in the beginning and 141.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:09:44,458 INFO L158 Benchmark]: IcfgBuilder took 745.69ms. Allocated memory is still 247.5MB. Free memory was 141.9MB in the beginning and 157.4MB in the end (delta: -15.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-16 19:09:44,458 INFO L158 Benchmark]: TraceAbstraction took 28900.19ms. Allocated memory was 247.5MB in the beginning and 10.2GB in the end (delta: 9.9GB). Free memory was 156.4MB in the beginning and 9.0GB in the end (delta: -8.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-16 19:09:44,459 INFO L158 Benchmark]: Witness Printer took 79.72ms. Allocated memory is still 10.2GB. Free memory was 9.0GB in the beginning and 9.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 19:09:44,460 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.50ms. Allocated memory is still 247.5MB. Free memory was 175.7MB in the beginning and 148.7MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.36ms. Allocated memory is still 247.5MB. Free memory was 148.7MB in the beginning and 145.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.32ms. Allocated memory is still 247.5MB. Free memory was 145.7MB in the beginning and 141.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 745.69ms. Allocated memory is still 247.5MB. Free memory was 141.9MB in the beginning and 157.4MB in the end (delta: -15.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28900.19ms. Allocated memory was 247.5MB in the beginning and 10.2GB in the end (delta: 9.9GB). Free memory was 156.4MB in the beginning and 9.0GB in the end (delta: -8.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 79.72ms. Allocated memory is still 10.2GB. Free memory was 9.0GB in the beginning and 9.0GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t181=-3, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181=-3, t182=-2, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181=-3, t182=-2, t183=-1, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t181=-3, t182=-2, t183=-1, t184=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181=-3, t182=-2, t183=-1, t184=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 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) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 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 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181=-3, t182=-2, t183=-1, t184=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181=-3, t182=-2, t183=-1, t184=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 870]: 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: 872]: 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: 876]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 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: 28.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 957 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 947 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2448 IncrementalHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 3 mSDtfsCounter, 2448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=7, InterpolantAutomatonStates: 65, 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.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-11-16 19:09:44,486 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