/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:15:42,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:15:42,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:15:42,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:15:42,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:15:42,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:15:42,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:15:42,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:15:42,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:15:42,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:15:42,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:15:42,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:15:42,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:15:42,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:15:42,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:15:42,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:15:42,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:15:42,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:15:42,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:15:42,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:15:42,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:15:42,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:15:42,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:15:42,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:15:42,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:15:42,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:15:42,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:15:42,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:15:42,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:15:42,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:15:42,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:15:42,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:15:42,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:15:42,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:15:42,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:15:42,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:15:42,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:15:42,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:15:42,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:15:42,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:15:42,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:15:42,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:15:42,121 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:15:42,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:15:42,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:15:42,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:15:42,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:15:42,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:15:42,123 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:15:42,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:15:42,123 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:15:42,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:15:42,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:15:42,124 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:15:42,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:42,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:15:42,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:15:42,126 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:15:42,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:15:42,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:15:42,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:15:42,378 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:15:42,379 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:15:42,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2023-01-27 18:15:43,698 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:15:44,050 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:15:44,051 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2023-01-27 18:15:44,068 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31afbeb3/23745e18d7254bd6bb667ef6669868bb/FLAG5a1b5aac2 [2023-01-27 18:15:44,083 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31afbeb3/23745e18d7254bd6bb667ef6669868bb [2023-01-27 18:15:44,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:15:44,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:15:44,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:44,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:15:44,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:15:44,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b04fe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44, skipping insertion in model container [2023-01-27 18:15:44,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:15:44,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:15:44,335 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i[993,1006] [2023-01-27 18:15:44,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:44,534 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:15:44,553 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i[993,1006] [2023-01-27 18:15:44,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:15:44,628 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:44,628 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:15:44,634 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:15:44,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44 WrapperNode [2023-01-27 18:15:44,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:15:44,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:44,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:15:44,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:15:44,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,715 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-01-27 18:15:44,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:15:44,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:15:44,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:15:44,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:15:44,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:15:44,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:15:44,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:15:44,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:15:44,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (1/1) ... [2023-01-27 18:15:44,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:15:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:15:44,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:15:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:15:44,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:15:44,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:15:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:15:44,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:15:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:15:44,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:15:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:15:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:15:44,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:15:44,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:15:44,817 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:15:45,031 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:15:45,033 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:15:45,527 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:15:45,762 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:15:45,763 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:15:45,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:45 BoogieIcfgContainer [2023-01-27 18:15:45,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:15:45,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:15:45,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:15:45,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:15:45,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:15:44" (1/3) ... [2023-01-27 18:15:45,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a4b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:45, skipping insertion in model container [2023-01-27 18:15:45,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:15:44" (2/3) ... [2023-01-27 18:15:45,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a4b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:15:45, skipping insertion in model container [2023-01-27 18:15:45,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:15:45" (3/3) ... [2023-01-27 18:15:45,774 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2023-01-27 18:15:45,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:15:45,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:15:45,789 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:15:45,864 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:15:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-01-27 18:15:45,959 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-27 18:15:45,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:45,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-27 18:15:45,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-01-27 18:15:45,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2023-01-27 18:15:45,971 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:15:45,978 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2023-01-27 18:15:45,980 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2023-01-27 18:15:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2023-01-27 18:15:46,027 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-27 18:15:46,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:46,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-27 18:15:46,031 INFO L119 LiptonReduction]: Number of co-enabled transitions 1692 [2023-01-27 18:15:54,357 INFO L134 LiptonReduction]: Checked pairs total: 4188 [2023-01-27 18:15:54,357 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-01-27 18:15:54,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:15:54,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5ce1bd63, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:15:54,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:15:54,382 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-27 18:15:54,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:15:54,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:54,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:54,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:54,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1725567123, now seen corresponding path program 1 times [2023-01-27 18:15:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:54,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332082605] [2023-01-27 18:15:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:54,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332082605] [2023-01-27 18:15:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332082605] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:15:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288720252] [2023-01-27 18:15:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:54,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:54,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-01-27 18:15:54,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:54,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:54,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-01-27 18:15:54,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:55,230 INFO L130 PetriNetUnfolder]: 511/787 cut-off events. [2023-01-27 18:15:55,230 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-27 18:15:55,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 787 events. 511/787 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3422 event pairs, 112 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 1595. Up to 580 conditions per place. [2023-01-27 18:15:55,240 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-01-27 18:15:55,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2023-01-27 18:15:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-01-27 18:15:55,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056022408963585 [2023-01-27 18:15:55,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-01-27 18:15:55,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-01-27 18:15:55,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:55,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-01-27 18:15:55,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-01-27 18:15:55,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:55,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:55,272 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 51 flow. Second operand 3 states and 361 transitions. [2023-01-27 18:15:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2023-01-27 18:15:55,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:15:55,276 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-01-27 18:15:55,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-01-27 18:15:55,281 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-27 18:15:55,282 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-01-27 18:15:55,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:55,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:55,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:55,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:15:55,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:55,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash -412554109, now seen corresponding path program 1 times [2023-01-27 18:15:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67970028] [2023-01-27 18:15:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67970028] [2023-01-27 18:15:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67970028] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:15:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301232925] [2023-01-27 18:15:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:55,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:55,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 238 [2023-01-27 18:15:55,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2023-01-27 18:15:55,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:55,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 238 [2023-01-27 18:15:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:55,832 INFO L130 PetriNetUnfolder]: 703/1064 cut-off events. [2023-01-27 18:15:55,832 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-01-27 18:15:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1064 events. 703/1064 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4370 event pairs, 159 based on Foata normal form. 8/1072 useless extension candidates. Maximal degree in co-relation 2250. Up to 1005 conditions per place. [2023-01-27 18:15:55,838 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-01-27 18:15:55,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 140 flow [2023-01-27 18:15:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-01-27 18:15:55,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49859943977591037 [2023-01-27 18:15:55,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-01-27 18:15:55,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-01-27 18:15:55,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:55,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-01-27 18:15:55,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-01-27 18:15:55,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:55,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:55,848 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 356 transitions. [2023-01-27 18:15:55,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 140 flow [2023-01-27 18:15:55,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:15:55,851 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-01-27 18:15:55,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-01-27 18:15:55,852 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-27 18:15:55,852 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-01-27 18:15:55,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2023-01-27 18:15:55,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:55,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:55,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:15:55,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:55,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 95723769, now seen corresponding path program 1 times [2023-01-27 18:15:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813390691] [2023-01-27 18:15:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813390691] [2023-01-27 18:15:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813390691] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:15:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094193404] [2023-01-27 18:15:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:56,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:56,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-01-27 18:15:56,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:56,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:56,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-01-27 18:15:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:56,321 INFO L130 PetriNetUnfolder]: 495/801 cut-off events. [2023-01-27 18:15:56,321 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-01-27 18:15:56,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 801 events. 495/801 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3509 event pairs, 145 based on Foata normal form. 12/812 useless extension candidates. Maximal degree in co-relation 1757. Up to 581 conditions per place. [2023-01-27 18:15:56,327 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-01-27 18:15:56,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 154 flow [2023-01-27 18:15:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-01-27 18:15:56,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-01-27 18:15:56,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-01-27 18:15:56,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-01-27 18:15:56,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:56,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-01-27 18:15:56,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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) [2023-01-27 18:15:56,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:56,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:56,332 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 360 transitions. [2023-01-27 18:15:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 154 flow [2023-01-27 18:15:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:15:56,333 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2023-01-27 18:15:56,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-27 18:15:56,334 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-01-27 18:15:56,334 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2023-01-27 18:15:56,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:56,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:56,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:56,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:15:56,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:56,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1327546821, now seen corresponding path program 1 times [2023-01-27 18:15:56,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:56,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938813469] [2023-01-27 18:15:56,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:56,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:56,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938813469] [2023-01-27 18:15:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938813469] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:15:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930561521] [2023-01-27 18:15:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:56,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:56,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-01-27 18:15:56,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:56,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:56,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-01-27 18:15:56,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:56,815 INFO L130 PetriNetUnfolder]: 540/851 cut-off events. [2023-01-27 18:15:56,816 INFO L131 PetriNetUnfolder]: For 272/273 co-relation queries the response was YES. [2023-01-27 18:15:56,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 851 events. 540/851 cut-off events. For 272/273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3553 event pairs, 176 based on Foata normal form. 20/870 useless extension candidates. Maximal degree in co-relation 2014. Up to 580 conditions per place. [2023-01-27 18:15:56,822 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-01-27 18:15:56,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 147 flow [2023-01-27 18:15:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-01-27 18:15:56,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014005602240896 [2023-01-27 18:15:56,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-01-27 18:15:56,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-01-27 18:15:56,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:56,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-01-27 18:15:56,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-01-27 18:15:56,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:56,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-01-27 18:15:56,834 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 3 states and 358 transitions. [2023-01-27 18:15:56,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 147 flow [2023-01-27 18:15:56,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:15:56,837 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2023-01-27 18:15:56,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-27 18:15:56,838 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2023-01-27 18:15:56,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2023-01-27 18:15:56,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2023-01-27 18:15:56,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:56,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:56,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:15:56,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:56,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -196912279, now seen corresponding path program 1 times [2023-01-27 18:15:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:56,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505352480] [2023-01-27 18:15:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:58,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505352480] [2023-01-27 18:15:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505352480] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:58,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:15:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182669572] [2023-01-27 18:15:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:58,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:15:58,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:15:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:15:58,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-01-27 18:15:58,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 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) [2023-01-27 18:15:58,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:58,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-01-27 18:15:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:58,627 INFO L130 PetriNetUnfolder]: 493/797 cut-off events. [2023-01-27 18:15:58,627 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2023-01-27 18:15:58,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 797 events. 493/797 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3442 event pairs, 43 based on Foata normal form. 18/814 useless extension candidates. Maximal degree in co-relation 1847. Up to 487 conditions per place. [2023-01-27 18:15:58,633 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 38 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-01-27 18:15:58,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 227 flow [2023-01-27 18:15:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-01-27 18:15:58,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41008403361344536 [2023-01-27 18:15:58,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-01-27 18:15:58,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-01-27 18:15:58,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:58,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-01-27 18:15:58,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 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) [2023-01-27 18:15:58,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-01-27 18:15:58,639 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-01-27 18:15:58,639 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 5 states and 488 transitions. [2023-01-27 18:15:58,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 227 flow [2023-01-27 18:15:58,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:15:58,642 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 107 flow [2023-01-27 18:15:58,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-01-27 18:15:58,643 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-27 18:15:58,643 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 107 flow [2023-01-27 18:15:58,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.57142857142857) internal successors, (634), 7 states have internal predecessors, (634), 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) [2023-01-27 18:15:58,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:58,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:58,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:15:58,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:58,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890377, now seen corresponding path program 1 times [2023-01-27 18:15:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542888183] [2023-01-27 18:15:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542888183] [2023-01-27 18:15:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542888183] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146993011] [2023-01-27 18:15:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:58,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:58,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:15:58,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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) [2023-01-27 18:15:58,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:58,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:15:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:59,174 INFO L130 PetriNetUnfolder]: 394/684 cut-off events. [2023-01-27 18:15:59,174 INFO L131 PetriNetUnfolder]: For 600/601 co-relation queries the response was YES. [2023-01-27 18:15:59,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 684 events. 394/684 cut-off events. For 600/601 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3152 event pairs, 67 based on Foata normal form. 71/752 useless extension candidates. Maximal degree in co-relation 1969. Up to 398 conditions per place. [2023-01-27 18:15:59,179 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 54 selfloop transitions, 7 changer transitions 5/69 dead transitions. [2023-01-27 18:15:59,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 418 flow [2023-01-27 18:15:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-01-27 18:15:59,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473109243697479 [2023-01-27 18:15:59,181 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-01-27 18:15:59,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-01-27 18:15:59,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:59,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-01-27 18:15:59,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 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) [2023-01-27 18:15:59,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-01-27 18:15:59,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-01-27 18:15:59,186 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 107 flow. Second operand 5 states and 563 transitions. [2023-01-27 18:15:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 418 flow [2023-01-27 18:15:59,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 405 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:15:59,191 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 157 flow [2023-01-27 18:15:59,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-01-27 18:15:59,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-01-27 18:15:59,193 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 157 flow [2023-01-27 18:15:59,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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) [2023-01-27 18:15:59,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:59,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:59,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:15:59,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:15:59,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2099250908, now seen corresponding path program 1 times [2023-01-27 18:15:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972058448] [2023-01-27 18:15:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:00,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:00,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972058448] [2023-01-27 18:16:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972058448] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:16:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307109927] [2023-01-27 18:16:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:00,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:16:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:00,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:16:00,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:16:00,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 238 [2023-01-27 18:16:00,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 157 flow. Second operand has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 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) [2023-01-27 18:16:00,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:00,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 238 [2023-01-27 18:16:00,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:01,287 INFO L130 PetriNetUnfolder]: 460/813 cut-off events. [2023-01-27 18:16:01,288 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2023-01-27 18:16:01,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 813 events. 460/813 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4008 event pairs, 41 based on Foata normal form. 4/813 useless extension candidates. Maximal degree in co-relation 2905. Up to 477 conditions per place. [2023-01-27 18:16:01,293 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 67 selfloop transitions, 17 changer transitions 7/94 dead transitions. [2023-01-27 18:16:01,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 94 transitions, 652 flow [2023-01-27 18:16:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:16:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:16:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 738 transitions. [2023-01-27 18:16:01,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38760504201680673 [2023-01-27 18:16:01,296 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 738 transitions. [2023-01-27 18:16:01,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 738 transitions. [2023-01-27 18:16:01,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:01,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 738 transitions. [2023-01-27 18:16:01,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.25) internal successors, (738), 8 states have internal predecessors, (738), 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) [2023-01-27 18:16:01,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 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) [2023-01-27 18:16:01,301 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 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) [2023-01-27 18:16:01,301 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 157 flow. Second operand 8 states and 738 transitions. [2023-01-27 18:16:01,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 94 transitions, 652 flow [2023-01-27 18:16:01,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:16:01,305 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 270 flow [2023-01-27 18:16:01,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-01-27 18:16:01,306 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-01-27 18:16:01,306 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 270 flow [2023-01-27 18:16:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.55555555555556) internal successors, (779), 9 states have internal predecessors, (779), 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) [2023-01-27 18:16:01,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:01,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:01,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:16:01,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:01,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2011668796, now seen corresponding path program 1 times [2023-01-27 18:16:01,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:01,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851958872] [2023-01-27 18:16:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851958872] [2023-01-27 18:16:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851958872] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:16:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315432204] [2023-01-27 18:16:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:01,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:01,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:01,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:01,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:01,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:16:01,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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) [2023-01-27 18:16:01,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:01,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:16:01,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:01,812 INFO L130 PetriNetUnfolder]: 301/558 cut-off events. [2023-01-27 18:16:01,812 INFO L131 PetriNetUnfolder]: For 1373/1373 co-relation queries the response was YES. [2023-01-27 18:16:01,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 558 events. 301/558 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2664 event pairs, 35 based on Foata normal form. 52/606 useless extension candidates. Maximal degree in co-relation 2171. Up to 217 conditions per place. [2023-01-27 18:16:01,817 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 87 selfloop transitions, 11 changer transitions 16/117 dead transitions. [2023-01-27 18:16:01,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 952 flow [2023-01-27 18:16:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:16:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:16:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-01-27 18:16:01,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47118847539015607 [2023-01-27 18:16:01,819 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-01-27 18:16:01,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-01-27 18:16:01,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:01,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-01-27 18:16:01,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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) [2023-01-27 18:16:01,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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) [2023-01-27 18:16:01,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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) [2023-01-27 18:16:01,824 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 270 flow. Second operand 7 states and 785 transitions. [2023-01-27 18:16:01,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 952 flow [2023-01-27 18:16:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 917 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:01,830 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 338 flow [2023-01-27 18:16:01,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-01-27 18:16:01,833 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2023-01-27 18:16:01,833 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 338 flow [2023-01-27 18:16:01,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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) [2023-01-27 18:16:01,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:01,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:16:01,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:01,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1043303351, now seen corresponding path program 1 times [2023-01-27 18:16:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051962472] [2023-01-27 18:16:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:02,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051962472] [2023-01-27 18:16:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051962472] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462764479] [2023-01-27 18:16:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:16:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:16:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:16:02,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-01-27 18:16:02,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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) [2023-01-27 18:16:02,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:02,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-01-27 18:16:02,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:02,493 INFO L130 PetriNetUnfolder]: 270/510 cut-off events. [2023-01-27 18:16:02,493 INFO L131 PetriNetUnfolder]: For 1435/1435 co-relation queries the response was YES. [2023-01-27 18:16:02,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 510 events. 270/510 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2480 event pairs, 32 based on Foata normal form. 14/520 useless extension candidates. Maximal degree in co-relation 2196. Up to 199 conditions per place. [2023-01-27 18:16:02,498 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 76 selfloop transitions, 15 changer transitions 15/109 dead transitions. [2023-01-27 18:16:02,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 903 flow [2023-01-27 18:16:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:16:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:16:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 991 transitions. [2023-01-27 18:16:02,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46265172735760973 [2023-01-27 18:16:02,505 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 991 transitions. [2023-01-27 18:16:02,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 991 transitions. [2023-01-27 18:16:02,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:02,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 991 transitions. [2023-01-27 18:16:02,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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) [2023-01-27 18:16:02,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 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) [2023-01-27 18:16:02,512 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 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) [2023-01-27 18:16:02,512 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 338 flow. Second operand 9 states and 991 transitions. [2023-01-27 18:16:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 903 flow [2023-01-27 18:16:02,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 810 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-01-27 18:16:02,521 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 267 flow [2023-01-27 18:16:02,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-01-27 18:16:02,522 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2023-01-27 18:16:02,523 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 267 flow [2023-01-27 18:16:02,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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) [2023-01-27 18:16:02,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:02,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:02,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:16:02,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:02,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1808435046, now seen corresponding path program 1 times [2023-01-27 18:16:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825623328] [2023-01-27 18:16:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:16:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:03,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825623328] [2023-01-27 18:16:03,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825623328] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:03,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:03,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:16:03,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019084466] [2023-01-27 18:16:03,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:03,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-01-27 18:16:03,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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) [2023-01-27 18:16:03,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:03,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-01-27 18:16:03,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:03,459 INFO L130 PetriNetUnfolder]: 337/680 cut-off events. [2023-01-27 18:16:03,460 INFO L131 PetriNetUnfolder]: For 1812/1813 co-relation queries the response was YES. [2023-01-27 18:16:03,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 680 events. 337/680 cut-off events. For 1812/1813 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3766 event pairs, 118 based on Foata normal form. 1/677 useless extension candidates. Maximal degree in co-relation 2954. Up to 365 conditions per place. [2023-01-27 18:16:03,465 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 63 selfloop transitions, 11 changer transitions 13/90 dead transitions. [2023-01-27 18:16:03,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 855 flow [2023-01-27 18:16:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:16:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:16:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2023-01-27 18:16:03,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45168067226890757 [2023-01-27 18:16:03,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions. [2023-01-27 18:16:03,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions. [2023-01-27 18:16:03,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:03,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions. [2023-01-27 18:16:03,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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) [2023-01-27 18:16:03,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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) [2023-01-27 18:16:03,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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) [2023-01-27 18:16:03,473 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 267 flow. Second operand 6 states and 645 transitions. [2023-01-27 18:16:03,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 855 flow [2023-01-27 18:16:03,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 685 flow, removed 44 selfloop flow, removed 7 redundant places. [2023-01-27 18:16:03,482 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 295 flow [2023-01-27 18:16:03,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-01-27 18:16:03,484 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2023-01-27 18:16:03,484 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 295 flow [2023-01-27 18:16:03,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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) [2023-01-27 18:16:03,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:03,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:16:03,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:03,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2099964626, now seen corresponding path program 2 times [2023-01-27 18:16:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:03,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210697830] [2023-01-27 18:16:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:03,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:16:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:03,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:16:03,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:16:03,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:16:03,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:16:03,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:16:03,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:16:03,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:16:03,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:16:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:16:03,679 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:03,684 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:16:03,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:16:03,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:16:03 BasicIcfg [2023-01-27 18:16:03,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:16:03,793 INFO L158 Benchmark]: Toolchain (without parser) took 19706.78ms. Allocated memory was 453.0MB in the beginning and 813.7MB in the end (delta: 360.7MB). Free memory was 402.8MB in the beginning and 679.0MB in the end (delta: -276.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,793 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 331.4MB. Free memory is still 281.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:16:03,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.17ms. Allocated memory is still 453.0MB. Free memory was 402.4MB in the beginning and 377.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.40ms. Allocated memory is still 453.0MB. Free memory was 377.7MB in the beginning and 375.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,794 INFO L158 Benchmark]: Boogie Preprocessor took 33.64ms. Allocated memory is still 453.0MB. Free memory was 375.0MB in the beginning and 372.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,794 INFO L158 Benchmark]: RCFGBuilder took 1014.76ms. Allocated memory is still 453.0MB. Free memory was 372.5MB in the beginning and 360.3MB in the end (delta: 12.2MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,795 INFO L158 Benchmark]: TraceAbstraction took 18025.49ms. Allocated memory was 453.0MB in the beginning and 813.7MB in the end (delta: 360.7MB). Free memory was 359.2MB in the beginning and 679.0MB in the end (delta: -319.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.0GB. [2023-01-27 18:16:03,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 331.4MB. Free memory is still 281.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 546.17ms. Allocated memory is still 453.0MB. Free memory was 402.4MB in the beginning and 377.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.40ms. Allocated memory is still 453.0MB. Free memory was 377.7MB in the beginning and 375.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.64ms. Allocated memory is still 453.0MB. Free memory was 375.0MB in the beginning and 372.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1014.76ms. Allocated memory is still 453.0MB. Free memory was 372.5MB in the beginning and 360.3MB in the end (delta: 12.2MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. * TraceAbstraction took 18025.49ms. Allocated memory was 453.0MB in the beginning and 813.7MB in the end (delta: 360.7MB). Free memory was 359.2MB in the beginning and 679.0MB in the end (delta: -319.8MB). Peak memory consumption was 43.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 130 PlacesBefore, 31 PlacesAfterwards, 122 TransitionsBefore, 21 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 4188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1602, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 922, independent: 880, independent conditional: 0, independent unconditional: 880, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1602, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 922, unknown conditional: 0, unknown unconditional: 922] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1684, ((void *)0), P0, ((void *)0))=-3, t1684={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 pthread_t t1685; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1685, ((void *)0), P1, ((void *)0))=-2, t1684={7:0}, t1685={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L861] 0 pthread_t t1686; [L792] 2 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1686, ((void *)0), P2, ((void *)0))=-1, t1684={7:0}, t1685={5:0}, t1686={6:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 return 0; [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={7:0}, t1685={5:0}, t1686={6:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 3 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=8, InterpolantAutomatonStates: 52, 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.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 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! [2023-01-27 18:16:03,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...