/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:46:10,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:46:10,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:46:10,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:46:10,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:46:10,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:46:10,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:46:10,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:46:10,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:46:10,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:46:10,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:46:10,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:46:10,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:46:10,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:46:10,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:46:10,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:46:10,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:46:10,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:46:10,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:46:10,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:46:10,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:46:10,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:46:10,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:46:10,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:46:10,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:46:10,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:46:10,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:46:10,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:46:10,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:46:10,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:46:10,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:46:10,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:46:10,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:46:10,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:46:10,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:46:10,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:46:10,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:46:10,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:46:10,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:46:10,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:46:10,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:46:10,990 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-28 00:46:11,007 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:46:11,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:46:11,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:46:11,009 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:46:11,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:46:11,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:46:11,009 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:46:11,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:46:11,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:46:11,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:46:11,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:11,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:46:11,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:46:11,012 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:46:11,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:46:11,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:46:11,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:46:11,226 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:46:11,227 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:46:11,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-01-28 00:46:12,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:46:12,654 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:46:12,654 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2023-01-28 00:46:12,675 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b877edd/792dc9c44874450297c89f47d9f36134/FLAGe7ba1d214 [2023-01-28 00:46:12,973 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b877edd/792dc9c44874450297c89f47d9f36134 [2023-01-28 00:46:12,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:46:12,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:46:12,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:12,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:46:12,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:46:12,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:12" (1/1) ... [2023-01-28 00:46:12,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b40651d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:12, skipping insertion in model container [2023-01-28 00:46:12,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:12" (1/1) ... [2023-01-28 00:46:12,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:46:13,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:46:13,142 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/safe006_power.opt-thin000_power.opt.i[969,982] [2023-01-28 00:46:13,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:13,354 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:46:13,369 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/safe006_power.opt-thin000_power.opt.i[969,982] [2023-01-28 00:46:13,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:13,450 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:13,451 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:13,457 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:46:13,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13 WrapperNode [2023-01-28 00:46:13,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:13,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:13,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:46:13,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:46:13,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,511 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-01-28 00:46:13,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:13,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:46:13,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:46:13,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:46:13,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:46:13,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:46:13,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:46:13,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:46:13,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (1/1) ... [2023-01-28 00:46:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:46:13,582 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-28 00:46:13,584 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-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:46:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:46:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:46:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:46:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:46:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:46:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:46:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:46:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:46:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:46:13,613 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:46:13,762 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:46:13,763 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:46:14,158 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:46:14,438 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:46:14,438 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:46:14,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:14 BoogieIcfgContainer [2023-01-28 00:46:14,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:46:14,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:46:14,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:46:14,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:46:14,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:46:12" (1/3) ... [2023-01-28 00:46:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574f2f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:14, skipping insertion in model container [2023-01-28 00:46:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:13" (2/3) ... [2023-01-28 00:46:14,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574f2f47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:14, skipping insertion in model container [2023-01-28 00:46:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:14" (3/3) ... [2023-01-28 00:46:14,451 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2023-01-28 00:46:14,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:46:14,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:46:14,467 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:46:14,533 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:46:14,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 220 flow [2023-01-28 00:46:14,633 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:46:14,633 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 00:46:14,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 105 transitions, 220 flow [2023-01-28 00:46:14,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 212 flow [2023-01-28 00:46:14,644 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:46:14,653 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 212 flow [2023-01-28 00:46:14,656 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 212 flow [2023-01-28 00:46:14,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 212 flow [2023-01-28 00:46:14,685 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:46:14,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 00:46:14,688 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-01-28 00:46:21,391 INFO L134 LiptonReduction]: Checked pairs total: 2805 [2023-01-28 00:46:21,391 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-28 00:46:21,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:46:21,408 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;@d28c196, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:46:21,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:46:21,410 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-01-28 00:46:21,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:21,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:21,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-01-28 00:46:21,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:21,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash 22253809, now seen corresponding path program 1 times [2023-01-28 00:46:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647686059] [2023-01-28 00:46:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:21,784 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-28 00:46:21,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647686059] [2023-01-28 00:46:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647686059] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:21,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:46:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736819723] [2023-01-28 00:46:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:21,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:46:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:46:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:46:21,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 202 [2023-01-28 00:46:21,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-28 00:46:21,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:21,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 202 [2023-01-28 00:46:21,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:22,027 INFO L130 PetriNetUnfolder]: 144/259 cut-off events. [2023-01-28 00:46:22,027 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 00:46:22,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 259 events. 144/259 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1010 event pairs, 45 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 520. Up to 166 conditions per place. [2023-01-28 00:46:22,031 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 20 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-01-28 00:46:22,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 107 flow [2023-01-28 00:46:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:46:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:46:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-01-28 00:46:22,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966996699669967 [2023-01-28 00:46:22,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-01-28 00:46:22,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-01-28 00:46:22,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:22,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-01-28 00:46:22,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-28 00:46:22,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 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-28 00:46:22,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 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-28 00:46:22,067 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 301 transitions. [2023-01-28 00:46:22,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 107 flow [2023-01-28 00:46:22,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:22,071 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-01-28 00:46:22,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 00:46:22,075 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-01-28 00:46:22,076 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-01-28 00:46:22,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-28 00:46:22,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:22,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:46:22,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:22,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1592907230, now seen corresponding path program 1 times [2023-01-28 00:46:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089155571] [2023-01-28 00:46:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:22,363 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-28 00:46:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:22,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089155571] [2023-01-28 00:46:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089155571] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:22,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:46:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710799841] [2023-01-28 00:46:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:22,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:46:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:46:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:46:22,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-01-28 00:46:22,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-28 00:46:22,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:22,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-01-28 00:46:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:22,480 INFO L130 PetriNetUnfolder]: 106/195 cut-off events. [2023-01-28 00:46:22,480 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-01-28 00:46:22,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 195 events. 106/195 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 658 event pairs, 44 based on Foata normal form. 4/198 useless extension candidates. Maximal degree in co-relation 412. Up to 173 conditions per place. [2023-01-28 00:46:22,484 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 19 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-01-28 00:46:22,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 96 flow [2023-01-28 00:46:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:46:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:46:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-01-28 00:46:22,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867986798679868 [2023-01-28 00:46:22,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-01-28 00:46:22,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-01-28 00:46:22,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:22,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-01-28 00:46:22,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-28 00:46:22,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 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-28 00:46:22,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 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-28 00:46:22,491 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 295 transitions. [2023-01-28 00:46:22,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 96 flow [2023-01-28 00:46:22,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:22,493 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2023-01-28 00:46:22,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 00:46:22,494 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-01-28 00:46:22,494 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2023-01-28 00:46:22,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-28 00:46:22,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:22,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:22,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:46:22,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:22,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2135482884, now seen corresponding path program 1 times [2023-01-28 00:46:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866497123] [2023-01-28 00:46:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:22,683 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-28 00:46:22,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866497123] [2023-01-28 00:46:22,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866497123] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:22,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:22,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056988886] [2023-01-28 00:46:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:22,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-01-28 00:46:22,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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-28 00:46:22,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:22,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-01-28 00:46:22,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:22,813 INFO L130 PetriNetUnfolder]: 160/294 cut-off events. [2023-01-28 00:46:22,813 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2023-01-28 00:46:22,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 294 events. 160/294 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1050 event pairs, 47 based on Foata normal form. 20/314 useless extension candidates. Maximal degree in co-relation 640. Up to 114 conditions per place. [2023-01-28 00:46:22,818 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 18 selfloop transitions, 3 changer transitions 7/28 dead transitions. [2023-01-28 00:46:22,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 127 flow [2023-01-28 00:46:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 386 transitions. [2023-01-28 00:46:22,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777227722772277 [2023-01-28 00:46:22,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 386 transitions. [2023-01-28 00:46:22,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 386 transitions. [2023-01-28 00:46:22,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:22,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 386 transitions. [2023-01-28 00:46:22,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.5) internal successors, (386), 4 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-28 00:46:22,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 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-28 00:46:22,824 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 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-28 00:46:22,824 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 386 transitions. [2023-01-28 00:46:22,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 127 flow [2023-01-28 00:46:22,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:22,825 INFO L231 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2023-01-28 00:46:22,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2023-01-28 00:46:22,826 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-01-28 00:46:22,829 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 52 flow [2023-01-28 00:46:22,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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-28 00:46:22,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:22,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:46:22,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:22,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -837330851, now seen corresponding path program 1 times [2023-01-28 00:46:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217366968] [2023-01-28 00:46:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:23,996 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-28 00:46:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217366968] [2023-01-28 00:46:23,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217366968] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:23,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:23,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375048461] [2023-01-28 00:46:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:23,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:46:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:46:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:46:23,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 202 [2023-01-28 00:46:24,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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-28 00:46:24,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:24,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 202 [2023-01-28 00:46:24,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:24,131 INFO L130 PetriNetUnfolder]: 67/131 cut-off events. [2023-01-28 00:46:24,131 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-01-28 00:46:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 131 events. 67/131 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 348 event pairs, 20 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 320. Up to 108 conditions per place. [2023-01-28 00:46:24,132 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 19 selfloop transitions, 6 changer transitions 0/26 dead transitions. [2023-01-28 00:46:24,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 128 flow [2023-01-28 00:46:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2023-01-28 00:46:24,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38811881188118813 [2023-01-28 00:46:24,134 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 392 transitions. [2023-01-28 00:46:24,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 392 transitions. [2023-01-28 00:46:24,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:24,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 392 transitions. [2023-01-28 00:46:24,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-28 00:46:24,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:24,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:24,144 INFO L175 Difference]: Start difference. First operand has 26 places, 15 transitions, 52 flow. Second operand 5 states and 392 transitions. [2023-01-28 00:46:24,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 128 flow [2023-01-28 00:46:24,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 111 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-01-28 00:46:24,147 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 74 flow [2023-01-28 00:46:24,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-01-28 00:46:24,148 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-01-28 00:46:24,149 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 74 flow [2023-01-28 00:46:24,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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-28 00:46:24,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:24,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:24,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:46:24,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:24,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1114709837, now seen corresponding path program 1 times [2023-01-28 00:46:24,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:24,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579996716] [2023-01-28 00:46:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:25,917 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-28 00:46:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579996716] [2023-01-28 00:46:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579996716] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:46:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587893894] [2023-01-28 00:46:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:46:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:46:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:46:25,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 202 [2023-01-28 00:46:25,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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-28 00:46:25,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:25,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 202 [2023-01-28 00:46:25,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:26,096 INFO L130 PetriNetUnfolder]: 72/141 cut-off events. [2023-01-28 00:46:26,096 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-01-28 00:46:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 141 events. 72/141 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 393 event pairs, 10 based on Foata normal form. 4/145 useless extension candidates. Maximal degree in co-relation 378. Up to 82 conditions per place. [2023-01-28 00:46:26,097 INFO L137 encePairwiseOnDemand]: 195/202 looper letters, 21 selfloop transitions, 8 changer transitions 0/30 dead transitions. [2023-01-28 00:46:26,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 162 flow [2023-01-28 00:46:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2023-01-28 00:46:26,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38811881188118813 [2023-01-28 00:46:26,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 392 transitions. [2023-01-28 00:46:26,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 392 transitions. [2023-01-28 00:46:26,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:26,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 392 transitions. [2023-01-28 00:46:26,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-28 00:46:26,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:26,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:26,103 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 74 flow. Second operand 5 states and 392 transitions. [2023-01-28 00:46:26,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 162 flow [2023-01-28 00:46:26,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:46:26,106 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 125 flow [2023-01-28 00:46:26,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-01-28 00:46:26,108 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-01-28 00:46:26,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 125 flow [2023-01-28 00:46:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.42857142857143) internal successors, (521), 7 states have internal predecessors, (521), 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-28 00:46:26,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:26,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:26,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:46:26,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:26,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 196256506, now seen corresponding path program 1 times [2023-01-28 00:46:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583883684] [2023-01-28 00:46:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:26,408 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-28 00:46:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583883684] [2023-01-28 00:46:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583883684] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952586817] [2023-01-28 00:46:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:26,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:26,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:26,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:46:26,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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-28 00:46:26,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:26,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:46:26,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:26,497 INFO L130 PetriNetUnfolder]: 45/106 cut-off events. [2023-01-28 00:46:26,497 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-01-28 00:46:26,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 106 events. 45/106 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 334 event pairs, 4 based on Foata normal form. 18/124 useless extension candidates. Maximal degree in co-relation 345. Up to 54 conditions per place. [2023-01-28 00:46:26,498 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 24 selfloop transitions, 3 changer transitions 20/48 dead transitions. [2023-01-28 00:46:26,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 341 flow [2023-01-28 00:46:26,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-01-28 00:46:26,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45643564356435645 [2023-01-28 00:46:26,501 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-01-28 00:46:26,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-01-28 00:46:26,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:26,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-01-28 00:46:26,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 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-28 00:46:26,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:26,505 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:26,506 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 125 flow. Second operand 5 states and 461 transitions. [2023-01-28 00:46:26,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 341 flow [2023-01-28 00:46:26,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 308 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 00:46:26,510 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 126 flow [2023-01-28 00:46:26,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2023-01-28 00:46:26,512 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2023-01-28 00:46:26,512 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 126 flow [2023-01-28 00:46:26,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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-28 00:46:26,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:26,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:26,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:46:26,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:26,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1217478667, now seen corresponding path program 1 times [2023-01-28 00:46:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748101280] [2023-01-28 00:46:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:27,640 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-28 00:46:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748101280] [2023-01-28 00:46:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748101280] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:27,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:27,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:46:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050098603] [2023-01-28 00:46:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:27,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:46:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:27,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:46:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:46:27,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 202 [2023-01-28 00:46:27,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 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-28 00:46:27,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:27,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 202 [2023-01-28 00:46:27,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:27,779 INFO L130 PetriNetUnfolder]: 27/71 cut-off events. [2023-01-28 00:46:27,779 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-28 00:46:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 71 events. 27/71 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 174 event pairs, 5 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 268. Up to 45 conditions per place. [2023-01-28 00:46:27,780 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 20 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2023-01-28 00:46:27,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 212 flow [2023-01-28 00:46:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 379 transitions. [2023-01-28 00:46:27,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37524752475247525 [2023-01-28 00:46:27,783 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 379 transitions. [2023-01-28 00:46:27,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 379 transitions. [2023-01-28 00:46:27,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:27,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 379 transitions. [2023-01-28 00:46:27,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-28 00:46:27,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:27,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 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-28 00:46:27,786 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 126 flow. Second operand 5 states and 379 transitions. [2023-01-28 00:46:27,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 212 flow [2023-01-28 00:46:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 199 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:27,788 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 147 flow [2023-01-28 00:46:27,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-01-28 00:46:27,790 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-01-28 00:46:27,790 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 147 flow [2023-01-28 00:46:27,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.5) internal successors, (580), 8 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-28 00:46:27,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:27,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:27,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:46:27,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:27,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash 995833627, now seen corresponding path program 2 times [2023-01-28 00:46:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:27,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985049629] [2023-01-28 00:46:27,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:28,054 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-28 00:46:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985049629] [2023-01-28 00:46:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985049629] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000783324] [2023-01-28 00:46:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:28,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:28,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:46:28,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-28 00:46:28,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:28,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:46:28,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:28,131 INFO L130 PetriNetUnfolder]: 15/48 cut-off events. [2023-01-28 00:46:28,131 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-01-28 00:46:28,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 48 events. 15/48 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 1 based on Foata normal form. 8/56 useless extension candidates. Maximal degree in co-relation 181. Up to 20 conditions per place. [2023-01-28 00:46:28,132 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 21 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-01-28 00:46:28,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 284 flow [2023-01-28 00:46:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:46:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:46:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2023-01-28 00:46:28,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44471947194719474 [2023-01-28 00:46:28,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2023-01-28 00:46:28,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2023-01-28 00:46:28,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:28,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2023-01-28 00:46:28,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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-28 00:46:28,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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-28 00:46:28,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 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-28 00:46:28,139 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 147 flow. Second operand 6 states and 539 transitions. [2023-01-28 00:46:28,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 284 flow [2023-01-28 00:46:28,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 222 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-01-28 00:46:28,142 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 118 flow [2023-01-28 00:46:28,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2023-01-28 00:46:28,144 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2023-01-28 00:46:28,144 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 118 flow [2023-01-28 00:46:28,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 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-28 00:46:28,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:28,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:28,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:46:28,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:46:28,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -114117883, now seen corresponding path program 1 times [2023-01-28 00:46:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341259733] [2023-01-28 00:46:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:46:28,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:46:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:46:28,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:46:28,330 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:46:28,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:46:28,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 00:46:28,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:46:28,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:46:28,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 00:46:28,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:46:28,334 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:28,340 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:46:28,340 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:46:28,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:46:28 BasicIcfg [2023-01-28 00:46:28,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:46:28,418 INFO L158 Benchmark]: Toolchain (without parser) took 15442.63ms. Allocated memory was 652.2MB in the beginning and 1.0GB in the end (delta: 358.6MB). Free memory was 602.2MB in the beginning and 768.9MB in the end (delta: -166.8MB). Peak memory consumption was 192.9MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,419 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 367.0MB. Free memory was 316.8MB in the beginning and 316.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:46:28,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.17ms. Allocated memory is still 652.2MB. Free memory was 602.2MB in the beginning and 578.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.83ms. Allocated memory is still 652.2MB. Free memory was 578.5MB in the beginning and 576.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,419 INFO L158 Benchmark]: Boogie Preprocessor took 32.17ms. Allocated memory is still 652.2MB. Free memory was 576.1MB in the beginning and 574.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,419 INFO L158 Benchmark]: RCFGBuilder took 895.06ms. Allocated memory is still 652.2MB. Free memory was 573.9MB in the beginning and 557.2MB in the end (delta: 16.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,420 INFO L158 Benchmark]: TraceAbstraction took 13974.56ms. Allocated memory was 652.2MB in the beginning and 1.0GB in the end (delta: 358.6MB). Free memory was 556.1MB in the beginning and 768.9MB in the end (delta: -212.8MB). Peak memory consumption was 144.7MB. Max. memory is 16.0GB. [2023-01-28 00:46:28,421 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.19ms. Allocated memory is still 367.0MB. Free memory was 316.8MB in the beginning and 316.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 481.17ms. Allocated memory is still 652.2MB. Free memory was 602.2MB in the beginning and 578.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.83ms. Allocated memory is still 652.2MB. Free memory was 578.5MB in the beginning and 576.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.17ms. Allocated memory is still 652.2MB. Free memory was 576.1MB in the beginning and 574.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 895.06ms. Allocated memory is still 652.2MB. Free memory was 573.9MB in the beginning and 557.2MB in the end (delta: 16.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.0GB. * TraceAbstraction took 13974.56ms. Allocated memory was 652.2MB in the beginning and 1.0GB in the end (delta: 358.6MB). Free memory was 556.1MB in the beginning and 768.9MB in the end (delta: -212.8MB). Peak memory consumption was 144.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 108 PlacesBefore, 24 PlacesAfterwards, 103 TransitionsBefore, 17 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 2805 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1353, independent: 1200, independent conditional: 0, independent unconditional: 1200, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 607, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1353, independent: 629, independent conditional: 0, independent unconditional: 629, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 607, unknown conditional: 0, unknown unconditional: 607] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=-2, t1923={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=-1, t1923={7:0}, t1924={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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] EXPR 2 \read(x) [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] 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) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] 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) [L803] 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) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 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 [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 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=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_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=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=1] - UnprovableResult [Line: 18]: 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: 826]: 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: 828]: 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 5 procedures, 123 locations, 5 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: 13.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 1 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-28 00:46:28,438 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...