/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/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:19:40,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:19:40,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:19:40,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:19:40,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:19:40,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:19:40,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:19:40,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:19:40,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:19:40,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:19:40,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:19:40,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:19:40,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:19:40,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:19:40,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:19:40,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:19:40,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:19:40,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:19:40,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:19:40,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:19:40,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:19:40,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:19:40,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:19:40,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:19:40,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:19:40,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:19:40,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:19:40,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:19:40,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:19:40,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:19:40,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:19:40,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:19:40,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:19:40,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:19:40,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:19:40,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:19:40,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:19:40,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:19:40,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:19:40,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:19:40,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:19:40,260 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:19:40,285 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:19:40,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:19:40,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:19:40,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:19:40,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:19:40,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:19:40,287 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:19:40,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:19:40,287 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:19:40,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:19:40,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:19:40,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:19:40,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:19:40,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:19:40,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:19:40,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:19:40,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:19:40,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:19:40,290 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:19:40,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:19:40,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:19:40,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:19:40,485 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:19:40,487 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:19:40,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2023-01-27 18:19:41,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:19:41,691 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:19:41,692 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2023-01-27 18:19:41,702 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b765f4058/19d2e68076844104a47a72b08d978e4b/FLAG24dd9ecac [2023-01-27 18:19:41,711 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b765f4058/19d2e68076844104a47a72b08d978e4b [2023-01-27 18:19:41,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:19:41,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:19:41,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:19:41,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:19:41,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:19:41,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:19:41" (1/1) ... [2023-01-27 18:19:41,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a4e11a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:41, skipping insertion in model container [2023-01-27 18:19:41,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:19:41" (1/1) ... [2023-01-27 18:19:41,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:19:41,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:19:41,833 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/safe019_power.opt.i[994,1007] [2023-01-27 18:19:41,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:19:41,948 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:19:41,955 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/safe019_power.opt.i[994,1007] [2023-01-27 18:19:41,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:19:42,015 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:19:42,015 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:19:42,019 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:19:42,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42 WrapperNode [2023-01-27 18:19:42,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:19:42,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:19:42,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:19:42,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:19:42,029 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:19:42" (1/1) ... [2023-01-27 18:19:42,059 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:19:42" (1/1) ... [2023-01-27 18:19:42,077 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2023-01-27 18:19:42,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:19:42,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:19:42,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:19:42,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:19:42,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,098 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:19:42,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:19:42,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:19:42,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:19:42,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (1/1) ... [2023-01-27 18:19:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:19:42,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:19:42,125 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:19:42,137 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:19:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:19:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:19:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:19:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:19:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:19:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:19:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:19:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:19:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:19:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:19:42,152 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:19:42,267 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:19:42,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:19:42,725 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:19:43,004 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:19:43,004 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:19:43,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:19:43 BoogieIcfgContainer [2023-01-27 18:19:43,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:19:43,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:19:43,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:19:43,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:19:43,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:19:41" (1/3) ... [2023-01-27 18:19:43,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491d20ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:19:43, skipping insertion in model container [2023-01-27 18:19:43,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:19:42" (2/3) ... [2023-01-27 18:19:43,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491d20ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:19:43, skipping insertion in model container [2023-01-27 18:19:43,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:19:43" (3/3) ... [2023-01-27 18:19:43,012 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2023-01-27 18:19:43,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:19:43,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:19:43,023 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:19:43,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:19:43,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-01-27 18:19:43,182 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-01-27 18:19:43,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:19:43,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-01-27 18:19:43,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-01-27 18:19:43,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-01-27 18:19:43,200 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:19:43,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-01-27 18:19:43,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-01-27 18:19:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-01-27 18:19:43,252 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-01-27 18:19:43,252 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:19:43,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-01-27 18:19:43,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 2664 [2023-01-27 18:19:50,550 INFO L134 LiptonReduction]: Checked pairs total: 6224 [2023-01-27 18:19:50,550 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-01-27 18:19:50,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:19:50,575 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;@ca61c08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:19:50,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:19:50,579 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-27 18:19:50,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:19:50,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:50,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:19:50,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:50,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 922639811, now seen corresponding path program 1 times [2023-01-27 18:19:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613472016] [2023-01-27 18:19:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:50,953 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:19:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613472016] [2023-01-27 18:19:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613472016] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:19:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526945708] [2023-01-27 18:19:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:19:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:50,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:19:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:19:50,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 274 [2023-01-27 18:19:50,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:19:50,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:50,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 274 [2023-01-27 18:19:50,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:51,832 INFO L130 PetriNetUnfolder]: 3927/5380 cut-off events. [2023-01-27 18:19:51,832 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-01-27 18:19:51,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10932 conditions, 5380 events. 3927/5380 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 26399 event pairs, 717 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 10920. Up to 4291 conditions per place. [2023-01-27 18:19:51,859 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 37 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-01-27 18:19:51,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 184 flow [2023-01-27 18:19:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:19:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:19:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-01-27 18:19:51,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182481751824818 [2023-01-27 18:19:51,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-01-27 18:19:51,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-01-27 18:19:51,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:51,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-01-27 18:19:51,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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:19:51,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:51,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:51,886 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 426 transitions. [2023-01-27 18:19:51,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 184 flow [2023-01-27 18:19:51,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:19:51,891 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 60 flow [2023-01-27 18:19:51,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-01-27 18:19:51,894 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-01-27 18:19:51,895 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 60 flow [2023-01-27 18:19:51,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:19:51,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:51,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:51,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:19:51,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:51,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 229862385, now seen corresponding path program 1 times [2023-01-27 18:19:51,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192735098] [2023-01-27 18:19:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:52,155 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:19:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:52,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192735098] [2023-01-27 18:19:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192735098] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:52,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:52,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:19:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32583429] [2023-01-27 18:19:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:52,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:19:52,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:19:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:19:52,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-01-27 18:19:52,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:19:52,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:52,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-01-27 18:19:52,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:52,858 INFO L130 PetriNetUnfolder]: 3895/5344 cut-off events. [2023-01-27 18:19:52,858 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2023-01-27 18:19:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 5344 events. 3895/5344 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22731 event pairs, 967 based on Foata normal form. 32/5376 useless extension candidates. Maximal degree in co-relation 11244. Up to 4801 conditions per place. [2023-01-27 18:19:52,880 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-01-27 18:19:52,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 164 flow [2023-01-27 18:19:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:19:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:19:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-01-27 18:19:52,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024330900243309 [2023-01-27 18:19:52,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-01-27 18:19:52,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-01-27 18:19:52,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:52,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-01-27 18:19:52,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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:19:52,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:52,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:52,885 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 3 states and 413 transitions. [2023-01-27 18:19:52,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 164 flow [2023-01-27 18:19:52,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:19:52,887 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-01-27 18:19:52,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-01-27 18:19:52,887 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-01-27 18:19:52,887 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-01-27 18:19:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:19:52,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:52,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:52,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:19:52,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:52,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1464202709, now seen corresponding path program 1 times [2023-01-27 18:19:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321360901] [2023-01-27 18:19:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:53,114 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:19:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321360901] [2023-01-27 18:19:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321360901] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:19:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199377352] [2023-01-27 18:19:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:53,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:19:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:19:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:19:53,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-01-27 18:19:53,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:19:53,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:53,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-01-27 18:19:53,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:53,681 INFO L130 PetriNetUnfolder]: 3559/4960 cut-off events. [2023-01-27 18:19:53,681 INFO L131 PetriNetUnfolder]: For 432/432 co-relation queries the response was YES. [2023-01-27 18:19:53,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10799 conditions, 4960 events. 3559/4960 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21666 event pairs, 1031 based on Foata normal form. 48/5008 useless extension candidates. Maximal degree in co-relation 10788. Up to 3953 conditions per place. [2023-01-27 18:19:53,702 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-01-27 18:19:53,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 180 flow [2023-01-27 18:19:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:19:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:19:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-01-27 18:19:53,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085158150851582 [2023-01-27 18:19:53,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-01-27 18:19:53,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-01-27 18:19:53,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:53,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-01-27 18:19:53,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:19:53,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:53,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:53,706 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 75 flow. Second operand 3 states and 418 transitions. [2023-01-27 18:19:53,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 180 flow [2023-01-27 18:19:53,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:19:53,708 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 80 flow [2023-01-27 18:19:53,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-01-27 18:19:53,709 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-01-27 18:19:53,711 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 80 flow [2023-01-27 18:19:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:19:53,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:53,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:53,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:19:53,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:53,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1854381040, now seen corresponding path program 1 times [2023-01-27 18:19:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864037653] [2023-01-27 18:19:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:53,971 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:19:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864037653] [2023-01-27 18:19:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864037653] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:19:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499826797] [2023-01-27 18:19:53,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:53,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:19:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:19:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:19:53,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-01-27 18:19:53,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:19:53,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:53,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-01-27 18:19:53,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:54,513 INFO L130 PetriNetUnfolder]: 3226/4491 cut-off events. [2023-01-27 18:19:54,513 INFO L131 PetriNetUnfolder]: For 1077/1077 co-relation queries the response was YES. [2023-01-27 18:19:54,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10243 conditions, 4491 events. 3226/4491 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21229 event pairs, 594 based on Foata normal form. 60/4547 useless extension candidates. Maximal degree in co-relation 10230. Up to 3703 conditions per place. [2023-01-27 18:19:54,530 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-01-27 18:19:54,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 213 flow [2023-01-27 18:19:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:19:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:19:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-01-27 18:19:54,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51338199513382 [2023-01-27 18:19:54,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-01-27 18:19:54,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-01-27 18:19:54,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:54,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-01-27 18:19:54,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:19:54,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:54,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:54,535 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states and 422 transitions. [2023-01-27 18:19:54,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 213 flow [2023-01-27 18:19:54,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:19:54,536 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2023-01-27 18:19:54,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-01-27 18:19:54,537 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-01-27 18:19:54,537 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2023-01-27 18:19:54,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:19:54,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:54,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:54,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:19:54,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:54,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1256696326, now seen corresponding path program 1 times [2023-01-27 18:19:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:54,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650002915] [2023-01-27 18:19:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:54,739 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:19:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650002915] [2023-01-27 18:19:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650002915] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:19:54,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789838597] [2023-01-27 18:19:54,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:54,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:19:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:19:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:19:54,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-01-27 18:19:54,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:19:54,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:54,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-01-27 18:19:54,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:55,499 INFO L130 PetriNetUnfolder]: 4708/6553 cut-off events. [2023-01-27 18:19:55,499 INFO L131 PetriNetUnfolder]: For 2045/2045 co-relation queries the response was YES. [2023-01-27 18:19:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15268 conditions, 6553 events. 4708/6553 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 30564 event pairs, 2347 based on Foata normal form. 144/6697 useless extension candidates. Maximal degree in co-relation 15254. Up to 3773 conditions per place. [2023-01-27 18:19:55,519 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-01-27 18:19:55,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 197 flow [2023-01-27 18:19:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:19:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:19:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-01-27 18:19:55,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048661800486618 [2023-01-27 18:19:55,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-01-27 18:19:55,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-01-27 18:19:55,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:55,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-01-27 18:19:55,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:19:55,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:55,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 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:19:55,523 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 3 states and 415 transitions. [2023-01-27 18:19:55,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 197 flow [2023-01-27 18:19:55,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:19:55,526 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 91 flow [2023-01-27 18:19:55,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-01-27 18:19:55,526 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-01-27 18:19:55,526 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 91 flow [2023-01-27 18:19:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:19:55,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:55,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:19:55,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:55,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash -554658646, now seen corresponding path program 1 times [2023-01-27 18:19:55,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816969955] [2023-01-27 18:19:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:55,739 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:19:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816969955] [2023-01-27 18:19:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816969955] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:55,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:55,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:19:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174194621] [2023-01-27 18:19:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:55,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:19:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:19:55,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:19:55,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 274 [2023-01-27 18:19:55,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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:19:55,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:55,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 274 [2023-01-27 18:19:55,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:56,836 INFO L130 PetriNetUnfolder]: 7315/10204 cut-off events. [2023-01-27 18:19:56,836 INFO L131 PetriNetUnfolder]: For 4900/4900 co-relation queries the response was YES. [2023-01-27 18:19:56,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23584 conditions, 10204 events. 7315/10204 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 52469 event pairs, 1087 based on Foata normal form. 144/10348 useless extension candidates. Maximal degree in co-relation 23570. Up to 4849 conditions per place. [2023-01-27 18:19:56,859 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 43 selfloop transitions, 4 changer transitions 6/53 dead transitions. [2023-01-27 18:19:56,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2023-01-27 18:19:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:19:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:19:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-01-27 18:19:56,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018248175182481 [2023-01-27 18:19:56,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-01-27 18:19:56,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-01-27 18:19:56,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:56,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-01-27 18:19:56,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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:19:56,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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:19:56,864 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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:19:56,864 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 91 flow. Second operand 4 states and 550 transitions. [2023-01-27 18:19:56,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2023-01-27 18:19:56,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 259 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 18:19:56,869 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 99 flow [2023-01-27 18:19:56,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-27 18:19:56,870 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-01-27 18:19:56,870 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 99 flow [2023-01-27 18:19:56,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 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:19:56,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:56,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:56,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:19:56,870 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:56,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1256721312, now seen corresponding path program 2 times [2023-01-27 18:19:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038474964] [2023-01-27 18:19:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:57,991 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:19:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038474964] [2023-01-27 18:19:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038474964] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:57,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:19:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178782862] [2023-01-27 18:19:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:57,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:19:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:19:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:19:57,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 274 [2023-01-27 18:19:57,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 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:19:57,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:57,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 274 [2023-01-27 18:19:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:58,808 INFO L130 PetriNetUnfolder]: 3881/5473 cut-off events. [2023-01-27 18:19:58,808 INFO L131 PetriNetUnfolder]: For 3023/3058 co-relation queries the response was YES. [2023-01-27 18:19:58,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13198 conditions, 5473 events. 3881/5473 cut-off events. For 3023/3058 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26060 event pairs, 2165 based on Foata normal form. 12/5464 useless extension candidates. Maximal degree in co-relation 13182. Up to 5169 conditions per place. [2023-01-27 18:19:58,822 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 50 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2023-01-27 18:19:58,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 335 flow [2023-01-27 18:19:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:19:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:19:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-01-27 18:19:58,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4233576642335766 [2023-01-27 18:19:58,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-01-27 18:19:58,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-01-27 18:19:58,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:58,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-01-27 18:19:58,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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:19:58,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:19:58,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:19:58,827 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 99 flow. Second operand 5 states and 580 transitions. [2023-01-27 18:19:58,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 335 flow [2023-01-27 18:19:58,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 308 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-01-27 18:19:58,830 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 159 flow [2023-01-27 18:19:58,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-01-27 18:19:58,830 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-01-27 18:19:58,830 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 159 flow [2023-01-27 18:19:58,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 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:19:58,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:58,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:58,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:19:58,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:58,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 487647284, now seen corresponding path program 1 times [2023-01-27 18:19:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564282270] [2023-01-27 18:19:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:19:59,115 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:19:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:19:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564282270] [2023-01-27 18:19:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564282270] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:19:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:19:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:19:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7848727] [2023-01-27 18:19:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:19:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:19:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:19:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:19:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:19:59,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-01-27 18:19:59,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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:19:59,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:19:59,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-01-27 18:19:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:19:59,755 INFO L130 PetriNetUnfolder]: 3642/5310 cut-off events. [2023-01-27 18:19:59,755 INFO L131 PetriNetUnfolder]: For 3975/4011 co-relation queries the response was YES. [2023-01-27 18:19:59,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14634 conditions, 5310 events. 3642/5310 cut-off events. For 3975/4011 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 27512 event pairs, 521 based on Foata normal form. 401/5695 useless extension candidates. Maximal degree in co-relation 14617. Up to 2422 conditions per place. [2023-01-27 18:19:59,769 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 76 selfloop transitions, 6 changer transitions 1/85 dead transitions. [2023-01-27 18:19:59,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 525 flow [2023-01-27 18:19:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:19:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:19:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-01-27 18:19:59,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908759124087591 [2023-01-27 18:19:59,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-01-27 18:19:59,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-01-27 18:19:59,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:19:59,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-01-27 18:19:59,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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:19:59,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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:19:59,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 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:19:59,774 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 159 flow. Second operand 4 states and 538 transitions. [2023-01-27 18:19:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 525 flow [2023-01-27 18:19:59,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:19:59,777 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 201 flow [2023-01-27 18:19:59,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-01-27 18:19:59,777 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-01-27 18:19:59,777 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 201 flow [2023-01-27 18:19:59,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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:19:59,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:19:59,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:19:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:19:59,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:19:59,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:19:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2118197738, now seen corresponding path program 1 times [2023-01-27 18:19:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:19:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729304776] [2023-01-27 18:19:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:19:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:19:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:00,083 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:20:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729304776] [2023-01-27 18:20:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729304776] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:20:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523246466] [2023-01-27 18:20:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:00,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:20:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:20:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:20:00,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-01-27 18:20:00,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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:20:00,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:00,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-01-27 18:20:00,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:00,534 INFO L130 PetriNetUnfolder]: 2112/3225 cut-off events. [2023-01-27 18:20:00,535 INFO L131 PetriNetUnfolder]: For 3108/3127 co-relation queries the response was YES. [2023-01-27 18:20:00,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10804 conditions, 3225 events. 2112/3225 cut-off events. For 3108/3127 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16167 event pairs, 216 based on Foata normal form. 281/3494 useless extension candidates. Maximal degree in co-relation 10783. Up to 1122 conditions per place. [2023-01-27 18:20:00,547 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 76 selfloop transitions, 10 changer transitions 1/89 dead transitions. [2023-01-27 18:20:00,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 579 flow [2023-01-27 18:20:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:20:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:20:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-01-27 18:20:00,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912408759124088 [2023-01-27 18:20:00,549 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-01-27 18:20:00,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-01-27 18:20:00,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:00,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-01-27 18:20:00,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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:20:00,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:20:00,551 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:20:00,552 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 201 flow. Second operand 5 states and 673 transitions. [2023-01-27 18:20:00,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 579 flow [2023-01-27 18:20:00,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 558 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:20:00,556 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 247 flow [2023-01-27 18:20:00,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-01-27 18:20:00,557 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2023-01-27 18:20:00,557 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 247 flow [2023-01-27 18:20:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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:20:00,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:00,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:00,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:20:00,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:00,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1434887957, now seen corresponding path program 1 times [2023-01-27 18:20:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:00,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244972661] [2023-01-27 18:20:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:01,696 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:20:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244972661] [2023-01-27 18:20:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244972661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:01,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:01,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:20:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499446248] [2023-01-27 18:20:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:01,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:20:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:01,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:20:01,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:20:01,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 274 [2023-01-27 18:20:01,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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:20:01,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:01,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 274 [2023-01-27 18:20:01,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:02,339 INFO L130 PetriNetUnfolder]: 1767/2715 cut-off events. [2023-01-27 18:20:02,339 INFO L131 PetriNetUnfolder]: For 4004/4038 co-relation queries the response was YES. [2023-01-27 18:20:02,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 2715 events. 1767/2715 cut-off events. For 4004/4038 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12936 event pairs, 813 based on Foata normal form. 10/2713 useless extension candidates. Maximal degree in co-relation 10153. Up to 2084 conditions per place. [2023-01-27 18:20:02,349 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 102 selfloop transitions, 29 changer transitions 0/133 dead transitions. [2023-01-27 18:20:02,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 133 transitions, 1011 flow [2023-01-27 18:20:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:20:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:20:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-01-27 18:20:02,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44681960375391033 [2023-01-27 18:20:02,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-01-27 18:20:02,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-01-27 18:20:02,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:02,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-01-27 18:20:02,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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:20:02,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:02,356 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:02,356 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 247 flow. Second operand 7 states and 857 transitions. [2023-01-27 18:20:02,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 133 transitions, 1011 flow [2023-01-27 18:20:02,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 904 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-01-27 18:20:02,366 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 452 flow [2023-01-27 18:20:02,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2023-01-27 18:20:02,367 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2023-01-27 18:20:02,367 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 452 flow [2023-01-27 18:20:02,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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:20:02,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:02,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:02,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:20:02,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:02,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1450090521, now seen corresponding path program 2 times [2023-01-27 18:20:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:02,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597718087] [2023-01-27 18:20:02,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:04,204 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:20:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597718087] [2023-01-27 18:20:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597718087] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:20:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97840740] [2023-01-27 18:20:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:20:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:20:04,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:20:04,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 274 [2023-01-27 18:20:04,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 452 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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:20:04,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:04,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 274 [2023-01-27 18:20:04,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:04,788 INFO L130 PetriNetUnfolder]: 1995/3072 cut-off events. [2023-01-27 18:20:04,788 INFO L131 PetriNetUnfolder]: For 6633/6661 co-relation queries the response was YES. [2023-01-27 18:20:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12615 conditions, 3072 events. 1995/3072 cut-off events. For 6633/6661 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15096 event pairs, 811 based on Foata normal form. 4/3064 useless extension candidates. Maximal degree in co-relation 12589. Up to 2324 conditions per place. [2023-01-27 18:20:04,803 INFO L137 encePairwiseOnDemand]: 263/274 looper letters, 103 selfloop transitions, 28 changer transitions 24/157 dead transitions. [2023-01-27 18:20:04,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 157 transitions, 1271 flow [2023-01-27 18:20:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:20:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:20:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-01-27 18:20:04,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4337851929092805 [2023-01-27 18:20:04,805 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-01-27 18:20:04,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-01-27 18:20:04,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:04,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-01-27 18:20:04,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 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:20:04,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:04,810 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:04,810 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 452 flow. Second operand 7 states and 832 transitions. [2023-01-27 18:20:04,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 157 transitions, 1271 flow [2023-01-27 18:20:04,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 157 transitions, 1267 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-27 18:20:04,823 INFO L231 Difference]: Finished difference. Result has 71 places, 85 transitions, 690 flow [2023-01-27 18:20:04,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=690, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2023-01-27 18:20:04,823 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2023-01-27 18:20:04,823 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 85 transitions, 690 flow [2023-01-27 18:20:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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:20:04,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:04,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:04,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:20:04,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:04,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1412106243, now seen corresponding path program 3 times [2023-01-27 18:20:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:04,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142486092] [2023-01-27 18:20:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:06,888 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:20:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142486092] [2023-01-27 18:20:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142486092] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:06,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:06,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-01-27 18:20:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521392203] [2023-01-27 18:20:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 18:20:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 18:20:06,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-01-27 18:20:06,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 274 [2023-01-27 18:20:06,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 85 transitions, 690 flow. Second operand has 12 states, 12 states have (on average 88.5) internal successors, (1062), 12 states have internal predecessors, (1062), 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:20:06,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:06,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 274 [2023-01-27 18:20:06,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:08,194 INFO L130 PetriNetUnfolder]: 2031/3112 cut-off events. [2023-01-27 18:20:08,194 INFO L131 PetriNetUnfolder]: For 10136/10167 co-relation queries the response was YES. [2023-01-27 18:20:08,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14410 conditions, 3112 events. 2031/3112 cut-off events. For 10136/10167 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15178 event pairs, 857 based on Foata normal form. 14/3117 useless extension candidates. Maximal degree in co-relation 14378. Up to 2218 conditions per place. [2023-01-27 18:20:08,209 INFO L137 encePairwiseOnDemand]: 264/274 looper letters, 119 selfloop transitions, 63 changer transitions 0/184 dead transitions. [2023-01-27 18:20:08,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 184 transitions, 1660 flow [2023-01-27 18:20:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 18:20:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 18:20:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1155 transitions. [2023-01-27 18:20:08,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3512773722627737 [2023-01-27 18:20:08,212 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1155 transitions. [2023-01-27 18:20:08,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1155 transitions. [2023-01-27 18:20:08,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:08,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1155 transitions. [2023-01-27 18:20:08,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.25) internal successors, (1155), 12 states have internal predecessors, (1155), 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:20:08,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 274.0) internal successors, (3562), 13 states have internal predecessors, (3562), 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:20:08,218 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 274.0) internal successors, (3562), 13 states have internal predecessors, (3562), 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:20:08,218 INFO L175 Difference]: Start difference. First operand has 71 places, 85 transitions, 690 flow. Second operand 12 states and 1155 transitions. [2023-01-27 18:20:08,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 184 transitions, 1660 flow [2023-01-27 18:20:08,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 184 transitions, 1636 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 18:20:08,233 INFO L231 Difference]: Finished difference. Result has 86 places, 106 transitions, 1038 flow [2023-01-27 18:20:08,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1038, PETRI_PLACES=86, PETRI_TRANSITIONS=106} [2023-01-27 18:20:08,234 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2023-01-27 18:20:08,234 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 106 transitions, 1038 flow [2023-01-27 18:20:08,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.5) internal successors, (1062), 12 states have internal predecessors, (1062), 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:20:08,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:08,234 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:20:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:20:08,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:08,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1433221493, now seen corresponding path program 1 times [2023-01-27 18:20:08,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:08,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307359094] [2023-01-27 18:20:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:08,497 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:20:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307359094] [2023-01-27 18:20:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307359094] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:20:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122793100] [2023-01-27 18:20:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:08,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:20:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:20:08,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:20:08,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-01-27 18:20:08,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 106 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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:20:08,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:08,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-01-27 18:20:08,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:08,992 INFO L130 PetriNetUnfolder]: 1721/2644 cut-off events. [2023-01-27 18:20:08,992 INFO L131 PetriNetUnfolder]: For 13131/13144 co-relation queries the response was YES. [2023-01-27 18:20:08,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13374 conditions, 2644 events. 1721/2644 cut-off events. For 13131/13144 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12836 event pairs, 228 based on Foata normal form. 136/2767 useless extension candidates. Maximal degree in co-relation 13335. Up to 900 conditions per place. [2023-01-27 18:20:09,005 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 206 selfloop transitions, 14 changer transitions 8/230 dead transitions. [2023-01-27 18:20:09,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 230 transitions, 2667 flow [2023-01-27 18:20:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:20:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:20:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-01-27 18:20:09,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49148418491484186 [2023-01-27 18:20:09,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-01-27 18:20:09,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-01-27 18:20:09,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:09,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-01-27 18:20:09,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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:20:09,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 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:20:09,011 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 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:20:09,011 INFO L175 Difference]: Start difference. First operand has 86 places, 106 transitions, 1038 flow. Second operand 6 states and 808 transitions. [2023-01-27 18:20:09,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 230 transitions, 2667 flow [2023-01-27 18:20:09,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 230 transitions, 2473 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-01-27 18:20:09,030 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 962 flow [2023-01-27 18:20:09,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=962, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2023-01-27 18:20:09,031 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2023-01-27 18:20:09,031 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 962 flow [2023-01-27 18:20:09,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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:20:09,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:09,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:20:09,031 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:09,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1272773508, now seen corresponding path program 1 times [2023-01-27 18:20:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250565769] [2023-01-27 18:20:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:09,356 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:20:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:09,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250565769] [2023-01-27 18:20:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250565769] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:09,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:20:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655722584] [2023-01-27 18:20:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:09,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:20:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:20:09,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:20:09,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-01-27 18:20:09,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 962 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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:20:09,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:09,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-01-27 18:20:09,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:09,792 INFO L130 PetriNetUnfolder]: 1469/2220 cut-off events. [2023-01-27 18:20:09,792 INFO L131 PetriNetUnfolder]: For 10065/10077 co-relation queries the response was YES. [2023-01-27 18:20:09,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11632 conditions, 2220 events. 1469/2220 cut-off events. For 10065/10077 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10353 event pairs, 228 based on Foata normal form. 26/2233 useless extension candidates. Maximal degree in co-relation 11593. Up to 900 conditions per place. [2023-01-27 18:20:09,804 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 161 selfloop transitions, 18 changer transitions 31/211 dead transitions. [2023-01-27 18:20:09,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 211 transitions, 2356 flow [2023-01-27 18:20:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:20:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:20:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2023-01-27 18:20:09,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781021897810219 [2023-01-27 18:20:09,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2023-01-27 18:20:09,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2023-01-27 18:20:09,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:09,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2023-01-27 18:20:09,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 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:20:09,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:09,810 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:09,810 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 962 flow. Second operand 7 states and 917 transitions. [2023-01-27 18:20:09,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 211 transitions, 2356 flow [2023-01-27 18:20:09,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 211 transitions, 2256 flow, removed 21 selfloop flow, removed 8 redundant places. [2023-01-27 18:20:09,835 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 816 flow [2023-01-27 18:20:09,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=816, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2023-01-27 18:20:09,835 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2023-01-27 18:20:09,835 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 816 flow [2023-01-27 18:20:09,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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:20:09,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:09,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:09,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:20:09,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:09,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1743139410, now seen corresponding path program 1 times [2023-01-27 18:20:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956817546] [2023-01-27 18:20:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:09,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:10,068 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:20:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956817546] [2023-01-27 18:20:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956817546] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:20:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772376473] [2023-01-27 18:20:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:20:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:10,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:20:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:20:10,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 274 [2023-01-27 18:20:10,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 816 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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:20:10,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:10,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 274 [2023-01-27 18:20:10,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:10,363 INFO L130 PetriNetUnfolder]: 1238/1861 cut-off events. [2023-01-27 18:20:10,364 INFO L131 PetriNetUnfolder]: For 8368/8368 co-relation queries the response was YES. [2023-01-27 18:20:10,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9602 conditions, 1861 events. 1238/1861 cut-off events. For 8368/8368 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7928 event pairs, 168 based on Foata normal form. 1/1862 useless extension candidates. Maximal degree in co-relation 9565. Up to 683 conditions per place. [2023-01-27 18:20:10,372 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 108 selfloop transitions, 2 changer transitions 120/230 dead transitions. [2023-01-27 18:20:10,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 230 transitions, 2571 flow [2023-01-27 18:20:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:20:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:20:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-01-27 18:20:10,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491970802919708 [2023-01-27 18:20:10,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-01-27 18:20:10,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-01-27 18:20:10,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:10,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-01-27 18:20:10,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 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:20:10,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:20:10,382 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 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:20:10,382 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 816 flow. Second operand 5 states and 674 transitions. [2023-01-27 18:20:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 230 transitions, 2571 flow [2023-01-27 18:20:10,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 230 transitions, 2270 flow, removed 56 selfloop flow, removed 16 redundant places. [2023-01-27 18:20:10,400 INFO L231 Difference]: Finished difference. Result has 73 places, 88 transitions, 677 flow [2023-01-27 18:20:10,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=73, PETRI_TRANSITIONS=88} [2023-01-27 18:20:10,402 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2023-01-27 18:20:10,402 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 88 transitions, 677 flow [2023-01-27 18:20:10,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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:20:10,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:10,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:10,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:20:10,402 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:10,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:10,403 INFO L85 PathProgramCache]: Analyzing trace with hash -5330620, now seen corresponding path program 2 times [2023-01-27 18:20:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821818614] [2023-01-27 18:20:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:10,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:12,514 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:20:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821818614] [2023-01-27 18:20:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821818614] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-27 18:20:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921712296] [2023-01-27 18:20:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:12,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 18:20:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 18:20:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-01-27 18:20:12,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 274 [2023-01-27 18:20:12,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 88 transitions, 677 flow. Second operand has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 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:20:12,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:12,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 274 [2023-01-27 18:20:12,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:12,881 INFO L130 PetriNetUnfolder]: 760/1217 cut-off events. [2023-01-27 18:20:12,882 INFO L131 PetriNetUnfolder]: For 3106/3127 co-relation queries the response was YES. [2023-01-27 18:20:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5183 conditions, 1217 events. 760/1217 cut-off events. For 3106/3127 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5209 event pairs, 243 based on Foata normal form. 19/1236 useless extension candidates. Maximal degree in co-relation 5162. Up to 483 conditions per place. [2023-01-27 18:20:12,886 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 111 selfloop transitions, 32 changer transitions 33/177 dead transitions. [2023-01-27 18:20:12,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 177 transitions, 1471 flow [2023-01-27 18:20:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:20:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:20:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2023-01-27 18:20:12,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39520333680917624 [2023-01-27 18:20:12,889 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2023-01-27 18:20:12,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2023-01-27 18:20:12,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:12,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2023-01-27 18:20:12,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 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:20:12,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:12,893 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 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:20:12,893 INFO L175 Difference]: Start difference. First operand has 73 places, 88 transitions, 677 flow. Second operand 7 states and 758 transitions. [2023-01-27 18:20:12,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 177 transitions, 1471 flow [2023-01-27 18:20:12,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 177 transitions, 1447 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-27 18:20:12,899 INFO L231 Difference]: Finished difference. Result has 78 places, 95 transitions, 844 flow [2023-01-27 18:20:12,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=78, PETRI_TRANSITIONS=95} [2023-01-27 18:20:12,899 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2023-01-27 18:20:12,899 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 844 flow [2023-01-27 18:20:12,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 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:20:12,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:12,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:12,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:20:12,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:12,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash -25277826, now seen corresponding path program 3 times [2023-01-27 18:20:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734947812] [2023-01-27 18:20:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:15,183 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:20:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:15,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734947812] [2023-01-27 18:20:15,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734947812] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:15,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:15,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:20:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851873664] [2023-01-27 18:20:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:20:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:20:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:20:15,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 274 [2023-01-27 18:20:15,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 844 flow. Second operand has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 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:20:15,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:15,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 274 [2023-01-27 18:20:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:15,984 INFO L130 PetriNetUnfolder]: 1075/1760 cut-off events. [2023-01-27 18:20:15,984 INFO L131 PetriNetUnfolder]: For 6884/6911 co-relation queries the response was YES. [2023-01-27 18:20:15,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 1760 events. 1075/1760 cut-off events. For 6884/6911 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8739 event pairs, 160 based on Foata normal form. 25/1785 useless extension candidates. Maximal degree in co-relation 7967. Up to 570 conditions per place. [2023-01-27 18:20:15,991 INFO L137 encePairwiseOnDemand]: 264/274 looper letters, 153 selfloop transitions, 56 changer transitions 12/222 dead transitions. [2023-01-27 18:20:15,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 222 transitions, 1917 flow [2023-01-27 18:20:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:20:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:20:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1155 transitions. [2023-01-27 18:20:15,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4215328467153285 [2023-01-27 18:20:15,994 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1155 transitions. [2023-01-27 18:20:15,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1155 transitions. [2023-01-27 18:20:15,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:15,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1155 transitions. [2023-01-27 18:20:15,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.5) internal successors, (1155), 10 states have internal predecessors, (1155), 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:20:15,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 274.0) internal successors, (3014), 11 states have internal predecessors, (3014), 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:20:15,999 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 274.0) internal successors, (3014), 11 states have internal predecessors, (3014), 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:20:15,999 INFO L175 Difference]: Start difference. First operand has 78 places, 95 transitions, 844 flow. Second operand 10 states and 1155 transitions. [2023-01-27 18:20:15,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 222 transitions, 1917 flow [2023-01-27 18:20:16,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 222 transitions, 1824 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-01-27 18:20:16,011 INFO L231 Difference]: Finished difference. Result has 82 places, 113 transitions, 1068 flow [2023-01-27 18:20:16,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1068, PETRI_PLACES=82, PETRI_TRANSITIONS=113} [2023-01-27 18:20:16,011 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2023-01-27 18:20:16,011 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 113 transitions, 1068 flow [2023-01-27 18:20:16,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.3) internal successors, (1073), 10 states have internal predecessors, (1073), 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:20:16,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:16,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:16,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:20:16,012 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:16,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 338069040, now seen corresponding path program 4 times [2023-01-27 18:20:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191384056] [2023-01-27 18:20:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:18,041 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:20:18,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:18,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191384056] [2023-01-27 18:20:18,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191384056] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:18,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:18,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-27 18:20:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135101490] [2023-01-27 18:20:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:18,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 18:20:18,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:18,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 18:20:18,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-01-27 18:20:18,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 274 [2023-01-27 18:20:18,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 113 transitions, 1068 flow. Second operand has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 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:20:18,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:18,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 274 [2023-01-27 18:20:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:18,710 INFO L130 PetriNetUnfolder]: 1316/2198 cut-off events. [2023-01-27 18:20:18,711 INFO L131 PetriNetUnfolder]: For 9137/9164 co-relation queries the response was YES. [2023-01-27 18:20:18,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9757 conditions, 2198 events. 1316/2198 cut-off events. For 9137/9164 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11711 event pairs, 346 based on Foata normal form. 25/2223 useless extension candidates. Maximal degree in co-relation 9728. Up to 982 conditions per place. [2023-01-27 18:20:18,720 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 164 selfloop transitions, 53 changer transitions 23/241 dead transitions. [2023-01-27 18:20:18,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 241 transitions, 2148 flow [2023-01-27 18:20:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:20:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:20:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1037 transitions. [2023-01-27 18:20:18,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205190592051906 [2023-01-27 18:20:18,727 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1037 transitions. [2023-01-27 18:20:18,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1037 transitions. [2023-01-27 18:20:18,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:18,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1037 transitions. [2023-01-27 18:20:18,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 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:20:18,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 274.0) internal successors, (2740), 10 states have internal predecessors, (2740), 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:20:18,732 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 274.0) internal successors, (2740), 10 states have internal predecessors, (2740), 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:20:18,732 INFO L175 Difference]: Start difference. First operand has 82 places, 113 transitions, 1068 flow. Second operand 9 states and 1037 transitions. [2023-01-27 18:20:18,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 241 transitions, 2148 flow [2023-01-27 18:20:18,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 241 transitions, 2032 flow, removed 50 selfloop flow, removed 3 redundant places. [2023-01-27 18:20:18,746 INFO L231 Difference]: Finished difference. Result has 89 places, 118 transitions, 1161 flow [2023-01-27 18:20:18,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1161, PETRI_PLACES=89, PETRI_TRANSITIONS=118} [2023-01-27 18:20:18,746 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2023-01-27 18:20:18,746 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 118 transitions, 1161 flow [2023-01-27 18:20:18,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.3) internal successors, (1063), 10 states have internal predecessors, (1063), 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:20:18,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:18,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:18,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:20:18,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:20:18,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1394126700, now seen corresponding path program 5 times [2023-01-27 18:20:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:18,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671118803] [2023-01-27 18:20:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:20:18,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:20:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:20:18,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:20:18,926 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:20:18,927 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:20:18,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:20:18,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:20:18,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:20:18,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:20:18,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:20:18,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:20:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 18:20:18,931 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:18,934 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:20:18,934 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:20:19,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:20:19 BasicIcfg [2023-01-27 18:20:19,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:20:19,024 INFO L158 Benchmark]: Toolchain (without parser) took 37310.24ms. Allocated memory was 492.8MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 453.2MB in the beginning and 944.0MB in the end (delta: -490.7MB). Peak memory consumption was 692.1MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,024 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 348.1MB. Free memory is still 298.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:20:19,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.15ms. Allocated memory is still 492.8MB. Free memory was 452.7MB in the beginning and 426.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.47ms. Allocated memory is still 492.8MB. Free memory was 426.9MB in the beginning and 424.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,024 INFO L158 Benchmark]: Boogie Preprocessor took 25.01ms. Allocated memory is still 492.8MB. Free memory was 424.3MB in the beginning and 421.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,024 INFO L158 Benchmark]: RCFGBuilder took 902.98ms. Allocated memory is still 492.8MB. Free memory was 421.8MB in the beginning and 426.6MB in the end (delta: -4.8MB). Peak memory consumption was 73.8MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,025 INFO L158 Benchmark]: TraceAbstraction took 36015.45ms. Allocated memory was 492.8MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 425.6MB in the beginning and 944.0MB in the end (delta: -518.4MB). Peak memory consumption was 662.3MB. Max. memory is 16.0GB. [2023-01-27 18:20:19,026 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.10ms. Allocated memory is still 348.1MB. Free memory is still 298.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 306.15ms. Allocated memory is still 492.8MB. Free memory was 452.7MB in the beginning and 426.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.47ms. Allocated memory is still 492.8MB. Free memory was 426.9MB in the beginning and 424.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.01ms. Allocated memory is still 492.8MB. Free memory was 424.3MB in the beginning and 421.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 902.98ms. Allocated memory is still 492.8MB. Free memory was 421.8MB in the beginning and 426.6MB in the end (delta: -4.8MB). Peak memory consumption was 73.8MB. Max. memory is 16.0GB. * TraceAbstraction took 36015.45ms. Allocated memory was 492.8MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 425.6MB in the beginning and 944.0MB in the end (delta: -518.4MB). Peak memory consumption was 662.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 152 PlacesBefore, 39 PlacesAfterwards, 141 TransitionsBefore, 26 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 129 TotalNumberOfCompositions, 6224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2672, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1385, independent: 1347, independent conditional: 0, independent unconditional: 1347, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2672, independent: 1125, independent conditional: 0, independent unconditional: 1125, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1385, unknown conditional: 0, unknown unconditional: 1385] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2229, ((void *)0), P0, ((void *)0))=-3, t2229={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L884] 0 pthread_t t2230; [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2230, ((void *)0), P1, ((void *)0))=-2, t2229={7:0}, t2230={8: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L794] 2 x$w_buff1 = x$w_buff0 [L795] 2 x$w_buff0 = 1 [L796] 2 x$w_buff1_used = x$w_buff0_used [L797] 2 x$w_buff0_used = (_Bool)1 [L798] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L798] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L799] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L800] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L801] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L802] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L803] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L804] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L886] 0 pthread_t t2231; [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2231, ((void *)0), P2, ((void *)0))=-1, t2229={7:0}, t2230={8:0}, t2231={5: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L888] 0 pthread_t t2232; [L889] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2232, ((void *)0), P3, ((void *)0))=0, t2229={7:0}, t2230={8:0}, t2231={5:0}, t2232={6: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L826] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L826] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L826] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L827] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L828] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L829] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L830] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L831] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L832] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=0] [L840] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1] [L857] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice1=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 \read(x) [L860] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L860] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L860] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L861] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L862] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L863] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L864] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice0=0, weak$$choice1=0, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L807] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L808] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L809] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L810] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L811] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0: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=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L814] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 2 return 0; [L843] 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) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] EXPR 3 \read(x) [L843] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L843] 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) [L843] 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) [L844] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L845] 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 [L846] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L847] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L850] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L852] 3 return 0; [L867] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L869] 4 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L891] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={7:0}, t2230={8:0}, t2231={5:0}, t2232={6: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L893] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L893] RET 0 assume_abort_if_not(main$tmp_guard0) [L895] 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) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L895] 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) [L895] 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) [L896] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L897] 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 [L898] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L899] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2229={7:0}, t2230={8:0}, t2231={5:0}, t2232={6: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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L902] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L903] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L903] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L903] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L904] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L906] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, 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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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: 887]: 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: 889]: 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: 883]: 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: 885]: 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 9 procedures, 178 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2847 IncrementalHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 4 mSDtfsCounter, 2847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=18, InterpolantAutomatonStates: 103, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:20:19,046 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...