/usr/bin/java -Xmx8000000000 -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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:57:37,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:57:37,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:57:37,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:57:37,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:57:37,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:57:37,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:57:37,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:57:37,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:57:37,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:57:37,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:57:37,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:57:37,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:57:37,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:57:37,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:57:37,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:57:38,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:57:38,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:57:38,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:57:38,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:57:38,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:57:38,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:57:38,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:57:38,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:57:38,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:57:38,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:57:38,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:57:38,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:57:38,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:57:38,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:57:38,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:57:38,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:57:38,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:57:38,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:57:38,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:57:38,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:57:38,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:57:38,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:57:38,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:57:38,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:57:38,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:57:38,035 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-NoLbe.epf [2022-12-12 11:57:38,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:57:38,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:57:38,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:57:38,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:57:38,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:57:38,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:57:38,074 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:57:38,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:57:38,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:57:38,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:57:38,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:57:38,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:57:38,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:57:38,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:57:38,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:57:38,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:57:38,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:57:38,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:57:38,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:57:38,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:57:38,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:57:38,405 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:57:38,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 11:57:39,657 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:57:39,954 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:57:39,954 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 11:57:39,968 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c2f8544/46343f628d1344a2b16fde74a5d5ce85/FLAG4358cb335 [2022-12-12 11:57:39,982 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c2f8544/46343f628d1344a2b16fde74a5d5ce85 [2022-12-12 11:57:39,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:57:39,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:57:39,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:57:39,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:57:39,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:57:39,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:57:39" (1/1) ... [2022-12-12 11:57:39,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e9dd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:39, skipping insertion in model container [2022-12-12 11:57:39,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:57:39" (1/1) ... [2022-12-12 11:57:39,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:57:40,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:57:40,204 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 11:57:40,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:57:40,459 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:57:40,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 11:57:40,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:57:40,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:57:40,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:57:40,594 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:57:40,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40 WrapperNode [2022-12-12 11:57:40,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:57:40,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:57:40,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:57:40,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:57:40,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,674 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-12 11:57:40,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:57:40,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:57:40,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:57:40,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:57:40,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,711 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:57:40,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:57:40,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:57:40,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:57:40,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (1/1) ... [2022-12-12 11:57:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:57:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:57:40,764 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) [2022-12-12 11:57:40,786 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 [2022-12-12 11:57:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:57:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:57:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:57:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:57:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:57:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:57:40,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:57:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:57:40,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:57:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:57:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:57:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:57:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:57:40,806 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:57:40,990 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:57:40,991 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:57:41,239 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:57:41,375 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:57:41,375 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:57:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:57:41 BoogieIcfgContainer [2022-12-12 11:57:41,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:57:41,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:57:41,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:57:41,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:57:41,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:57:39" (1/3) ... [2022-12-12 11:57:41,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e13a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:57:41, skipping insertion in model container [2022-12-12 11:57:41,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:57:40" (2/3) ... [2022-12-12 11:57:41,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e13a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:57:41, skipping insertion in model container [2022-12-12 11:57:41,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:57:41" (3/3) ... [2022-12-12 11:57:41,387 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 11:57:41,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:57:41,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:57:41,404 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:57:41,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:57:41,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-12 11:57:41,546 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-12 11:57:41,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:57:41,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-12 11:57:41,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-12 11:57:41,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-12 11:57:41,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:57:41,571 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;@1bee3700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:57:41,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 11:57:41,603 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-12 11:57:41,604 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:57:41,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:41,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:41,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:57:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash -389193977, now seen corresponding path program 1 times [2022-12-12 11:57:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627404992] [2022-12-12 11:57:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:42,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627404992] [2022-12-12 11:57:42,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627404992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:42,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:42,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:57:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766538208] [2022-12-12 11:57:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:57:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:57:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:57:42,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 90 [2022-12-12 11:57:42,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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) [2022-12-12 11:57:42,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:42,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 90 [2022-12-12 11:57:42,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:42,326 INFO L130 PetriNetUnfolder]: 42/231 cut-off events. [2022-12-12 11:57:42,327 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 11:57:42,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 231 events. 42/231 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 849 event pairs, 15 based on Foata normal form. 17/234 useless extension candidates. Maximal degree in co-relation 280. Up to 63 conditions per place. [2022-12-12 11:57:42,336 INFO L137 encePairwiseOnDemand]: 85/90 looper letters, 14 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-12-12 11:57:42,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 221 flow [2022-12-12 11:57:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:57:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:57:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2022-12-12 11:57:42,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9222222222222223 [2022-12-12 11:57:42,354 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2022-12-12 11:57:42,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 221 flow [2022-12-12 11:57:42,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 11:57:42,360 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 216 flow [2022-12-12 11:57:42,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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) [2022-12-12 11:57:42,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:42,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:42,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:57:42,362 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)] === [2022-12-12 11:57:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -862639378, now seen corresponding path program 1 times [2022-12-12 11:57:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:42,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930694375] [2022-12-12 11:57:42,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:42,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930694375] [2022-12-12 11:57:42,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930694375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:42,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:42,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:57:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588424394] [2022-12-12 11:57:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:42,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:57:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:57:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:57:42,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2022-12-12 11:57:42,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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) [2022-12-12 11:57:42,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:42,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2022-12-12 11:57:42,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:43,167 INFO L130 PetriNetUnfolder]: 146/492 cut-off events. [2022-12-12 11:57:43,167 INFO L131 PetriNetUnfolder]: For 94/192 co-relation queries the response was YES. [2022-12-12 11:57:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 492 events. 146/492 cut-off events. For 94/192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2604 event pairs, 24 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 919. Up to 155 conditions per place. [2022-12-12 11:57:43,171 INFO L137 encePairwiseOnDemand]: 84/90 looper letters, 22 selfloop transitions, 3 changer transitions 48/134 dead transitions. [2022-12-12 11:57:43,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 508 flow [2022-12-12 11:57:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:57:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:57:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 681 transitions. [2022-12-12 11:57:43,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-12-12 11:57:43,176 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2022-12-12 11:57:43,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 508 flow [2022-12-12 11:57:43,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 504 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 11:57:43,180 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 134 transitions, 504 flow [2022-12-12 11:57:43,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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) [2022-12-12 11:57:43,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:43,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:43,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:57:43,181 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)] === [2022-12-12 11:57:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1470995843, now seen corresponding path program 1 times [2022-12-12 11:57:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:43,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487097079] [2022-12-12 11:57:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487097079] [2022-12-12 11:57:44,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487097079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:44,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:44,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 11:57:44,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329082257] [2022-12-12 11:57:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:57:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:57:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:57:44,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 90 [2022-12-12 11:57:44,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 134 transitions, 504 flow. Second operand has 10 states, 10 states have (on average 66.7) internal successors, (667), 10 states have internal predecessors, (667), 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) [2022-12-12 11:57:44,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:44,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 90 [2022-12-12 11:57:44,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:44,783 INFO L130 PetriNetUnfolder]: 209/694 cut-off events. [2022-12-12 11:57:44,783 INFO L131 PetriNetUnfolder]: For 223/518 co-relation queries the response was YES. [2022-12-12 11:57:44,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 694 events. 209/694 cut-off events. For 223/518 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4172 event pairs, 39 based on Foata normal form. 10/685 useless extension candidates. Maximal degree in co-relation 1657. Up to 248 conditions per place. [2022-12-12 11:57:44,787 INFO L137 encePairwiseOnDemand]: 79/90 looper letters, 30 selfloop transitions, 10 changer transitions 113/209 dead transitions. [2022-12-12 11:57:44,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 209 transitions, 1168 flow [2022-12-12 11:57:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 11:57:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 11:57:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1324 transitions. [2022-12-12 11:57:44,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7742690058479532 [2022-12-12 11:57:44,792 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 24 predicate places. [2022-12-12 11:57:44,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 209 transitions, 1168 flow [2022-12-12 11:57:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 209 transitions, 907 flow, removed 110 selfloop flow, removed 4 redundant places. [2022-12-12 11:57:44,798 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 209 transitions, 907 flow [2022-12-12 11:57:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.7) internal successors, (667), 10 states have internal predecessors, (667), 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) [2022-12-12 11:57:44,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:44,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:44,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:57:44,800 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)] === [2022-12-12 11:57:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash 999002321, now seen corresponding path program 1 times [2022-12-12 11:57:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245176465] [2022-12-12 11:57:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245176465] [2022-12-12 11:57:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245176465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 11:57:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586682928] [2022-12-12 11:57:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:46,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 11:57:46,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:46,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 11:57:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-12 11:57:46,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 90 [2022-12-12 11:57:46,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 209 transitions, 907 flow. Second operand has 12 states, 12 states have (on average 65.58333333333333) internal successors, (787), 12 states have internal predecessors, (787), 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) [2022-12-12 11:57:46,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:46,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 90 [2022-12-12 11:57:46,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:46,996 INFO L130 PetriNetUnfolder]: 247/903 cut-off events. [2022-12-12 11:57:46,996 INFO L131 PetriNetUnfolder]: For 113/369 co-relation queries the response was YES. [2022-12-12 11:57:46,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 903 events. 247/903 cut-off events. For 113/369 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6227 event pairs, 39 based on Foata normal form. 10/895 useless extension candidates. Maximal degree in co-relation 2134. Up to 293 conditions per place. [2022-12-12 11:57:47,001 INFO L137 encePairwiseOnDemand]: 79/90 looper letters, 27 selfloop transitions, 12 changer transitions 173/267 dead transitions. [2022-12-12 11:57:47,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 267 transitions, 1591 flow [2022-12-12 11:57:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 11:57:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 11:57:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1164 transitions. [2022-12-12 11:57:47,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7607843137254902 [2022-12-12 11:57:47,005 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 36 predicate places. [2022-12-12 11:57:47,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 267 transitions, 1591 flow [2022-12-12 11:57:47,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 267 transitions, 1474 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-12-12 11:57:47,010 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 267 transitions, 1474 flow [2022-12-12 11:57:47,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.58333333333333) internal successors, (787), 12 states have internal predecessors, (787), 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) [2022-12-12 11:57:47,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:47,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:47,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:57:47,012 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)] === [2022-12-12 11:57:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:47,012 INFO L85 PathProgramCache]: Analyzing trace with hash 900587641, now seen corresponding path program 1 times [2022-12-12 11:57:47,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:47,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325959148] [2022-12-12 11:57:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325959148] [2022-12-12 11:57:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325959148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 11:57:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91210287] [2022-12-12 11:57:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:57:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:57:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:57:48,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 90 [2022-12-12 11:57:48,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 267 transitions, 1474 flow. Second operand has 10 states, 10 states have (on average 61.4) internal successors, (614), 10 states have internal predecessors, (614), 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) [2022-12-12 11:57:48,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:48,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 90 [2022-12-12 11:57:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:49,630 INFO L130 PetriNetUnfolder]: 387/1476 cut-off events. [2022-12-12 11:57:49,630 INFO L131 PetriNetUnfolder]: For 322/1496 co-relation queries the response was YES. [2022-12-12 11:57:49,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 1476 events. 387/1476 cut-off events. For 322/1496 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12274 event pairs, 7 based on Foata normal form. 24/1482 useless extension candidates. Maximal degree in co-relation 4320. Up to 573 conditions per place. [2022-12-12 11:57:49,637 INFO L137 encePairwiseOnDemand]: 80/90 looper letters, 45 selfloop transitions, 15 changer transitions 303/413 dead transitions. [2022-12-12 11:57:49,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 413 transitions, 3332 flow [2022-12-12 11:57:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 11:57:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 11:57:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1230 transitions. [2022-12-12 11:57:49,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2022-12-12 11:57:49,641 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 51 predicate places. [2022-12-12 11:57:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 413 transitions, 3332 flow [2022-12-12 11:57:49,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 413 transitions, 2665 flow, removed 333 selfloop flow, removed 1 redundant places. [2022-12-12 11:57:49,651 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 413 transitions, 2665 flow [2022-12-12 11:57:49,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.4) internal successors, (614), 10 states have internal predecessors, (614), 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) [2022-12-12 11:57:49,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:49,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:57:49,652 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)] === [2022-12-12 11:57:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash -262144007, now seen corresponding path program 2 times [2022-12-12 11:57:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:49,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918051667] [2022-12-12 11:57:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:50,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918051667] [2022-12-12 11:57:50,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918051667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:50,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:50,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 11:57:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680434258] [2022-12-12 11:57:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:50,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:57:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:57:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-12 11:57:50,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 90 [2022-12-12 11:57:50,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 413 transitions, 2665 flow. Second operand has 13 states, 13 states have (on average 62.69230769230769) internal successors, (815), 13 states have internal predecessors, (815), 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) [2022-12-12 11:57:50,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:50,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 90 [2022-12-12 11:57:50,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:51,521 INFO L130 PetriNetUnfolder]: 565/2141 cut-off events. [2022-12-12 11:57:51,522 INFO L131 PetriNetUnfolder]: For 871/1805 co-relation queries the response was YES. [2022-12-12 11:57:51,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 2141 events. 565/2141 cut-off events. For 871/1805 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19645 event pairs, 2 based on Foata normal form. 15/2135 useless extension candidates. Maximal degree in co-relation 6748. Up to 715 conditions per place. [2022-12-12 11:57:51,532 INFO L137 encePairwiseOnDemand]: 78/90 looper letters, 56 selfloop transitions, 28 changer transitions 491/627 dead transitions. [2022-12-12 11:57:51,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 627 transitions, 5769 flow [2022-12-12 11:57:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 11:57:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 11:57:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1007 transitions. [2022-12-12 11:57:51,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7459259259259259 [2022-12-12 11:57:51,536 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 64 predicate places. [2022-12-12 11:57:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 627 transitions, 5769 flow [2022-12-12 11:57:51,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 627 transitions, 4955 flow, removed 382 selfloop flow, removed 4 redundant places. [2022-12-12 11:57:51,551 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 627 transitions, 4955 flow [2022-12-12 11:57:51,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.69230769230769) internal successors, (815), 13 states have internal predecessors, (815), 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) [2022-12-12 11:57:51,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:51,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:51,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:57:51,552 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)] === [2022-12-12 11:57:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2037913411, now seen corresponding path program 3 times [2022-12-12 11:57:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909176181] [2022-12-12 11:57:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909176181] [2022-12-12 11:57:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909176181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:53,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 11:57:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835156291] [2022-12-12 11:57:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:53,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 11:57:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 11:57:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-12-12 11:57:53,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 90 [2022-12-12 11:57:53,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 627 transitions, 4955 flow. Second operand has 14 states, 14 states have (on average 63.5) internal successors, (889), 14 states have internal predecessors, (889), 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) [2022-12-12 11:57:53,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:53,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 90 [2022-12-12 11:57:53,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:54,438 INFO L130 PetriNetUnfolder]: 619/2455 cut-off events. [2022-12-12 11:57:54,438 INFO L131 PetriNetUnfolder]: For 1049/3124 co-relation queries the response was YES. [2022-12-12 11:57:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8216 conditions, 2455 events. 619/2455 cut-off events. For 1049/3124 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 23888 event pairs, 1 based on Foata normal form. 61/2502 useless extension candidates. Maximal degree in co-relation 8157. Up to 633 conditions per place. [2022-12-12 11:57:54,451 INFO L137 encePairwiseOnDemand]: 76/90 looper letters, 59 selfloop transitions, 30 changer transitions 627/769 dead transitions. [2022-12-12 11:57:54,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 769 transitions, 7892 flow [2022-12-12 11:57:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-12 11:57:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-12 11:57:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1489 transitions. [2022-12-12 11:57:54,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.752020202020202 [2022-12-12 11:57:54,456 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 81 predicate places. [2022-12-12 11:57:54,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 769 transitions, 7892 flow [2022-12-12 11:57:54,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 769 transitions, 7231 flow, removed 327 selfloop flow, removed 4 redundant places. [2022-12-12 11:57:54,476 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 769 transitions, 7231 flow [2022-12-12 11:57:54,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.5) internal successors, (889), 14 states have internal predecessors, (889), 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) [2022-12-12 11:57:54,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:54,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:54,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:57:54,478 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)] === [2022-12-12 11:57:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1505302309, now seen corresponding path program 1 times [2022-12-12 11:57:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:54,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106478499] [2022-12-12 11:57:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:56,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106478499] [2022-12-12 11:57:56,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106478499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:56,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:56,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 11:57:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457036806] [2022-12-12 11:57:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:56,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 11:57:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:57:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 11:57:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-12 11:57:56,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 90 [2022-12-12 11:57:56,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 769 transitions, 7231 flow. Second operand has 14 states, 14 states have (on average 61.714285714285715) internal successors, (864), 14 states have internal predecessors, (864), 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) [2022-12-12 11:57:56,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:57:56,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 90 [2022-12-12 11:57:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:57:59,250 INFO L130 PetriNetUnfolder]: 786/3370 cut-off events. [2022-12-12 11:57:59,250 INFO L131 PetriNetUnfolder]: For 2087/5128 co-relation queries the response was YES. [2022-12-12 11:57:59,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12509 conditions, 3370 events. 786/3370 cut-off events. For 2087/5128 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 36185 event pairs, 0 based on Foata normal form. 97/3459 useless extension candidates. Maximal degree in co-relation 12446. Up to 1039 conditions per place. [2022-12-12 11:57:59,267 INFO L137 encePairwiseOnDemand]: 76/90 looper letters, 68 selfloop transitions, 54 changer transitions 1051/1224 dead transitions. [2022-12-12 11:57:59,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1224 transitions, 14773 flow [2022-12-12 11:57:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-12 11:57:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-12 11:57:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2463 transitions. [2022-12-12 11:57:59,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7201754385964912 [2022-12-12 11:57:59,274 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 114 predicate places. [2022-12-12 11:57:59,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1224 transitions, 14773 flow [2022-12-12 11:57:59,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1224 transitions, 12744 flow, removed 1013 selfloop flow, removed 2 redundant places. [2022-12-12 11:57:59,307 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1224 transitions, 12744 flow [2022-12-12 11:57:59,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.714285714285715) internal successors, (864), 14 states have internal predecessors, (864), 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) [2022-12-12 11:57:59,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:57:59,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:57:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:57:59,308 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)] === [2022-12-12 11:57:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:57:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1700993958, now seen corresponding path program 1 times [2022-12-12 11:57:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:57:59,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720917572] [2022-12-12 11:57:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:57:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:57:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:57:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:57:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:57:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720917572] [2022-12-12 11:57:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720917572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:57:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:57:59,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:57:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513144921] [2022-12-12 11:57:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:57:59,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:58:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:58:00,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:58:00,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 90 [2022-12-12 11:58:00,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1224 transitions, 12744 flow. Second operand has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 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) [2022-12-12 11:58:00,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:00,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 90 [2022-12-12 11:58:00,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:01,557 INFO L130 PetriNetUnfolder]: 1974/7890 cut-off events. [2022-12-12 11:58:01,557 INFO L131 PetriNetUnfolder]: For 13870/28706 co-relation queries the response was YES. [2022-12-12 11:58:01,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29213 conditions, 7890 events. 1974/7890 cut-off events. For 13870/28706 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 97814 event pairs, 18 based on Foata normal form. 9/7876 useless extension candidates. Maximal degree in co-relation 29148. Up to 1553 conditions per place. [2022-12-12 11:58:01,596 INFO L137 encePairwiseOnDemand]: 82/90 looper letters, 62 selfloop transitions, 4 changer transitions 2515/2630 dead transitions. [2022-12-12 11:58:01,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 2630 transitions, 32812 flow [2022-12-12 11:58:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:58:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:58:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 663 transitions. [2022-12-12 11:58:01,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7366666666666667 [2022-12-12 11:58:01,599 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 121 predicate places. [2022-12-12 11:58:01,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 2630 transitions, 32812 flow [2022-12-12 11:58:01,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 2630 transitions, 31682 flow, removed 535 selfloop flow, removed 2 redundant places. [2022-12-12 11:58:01,652 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 2630 transitions, 31682 flow [2022-12-12 11:58:01,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 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) [2022-12-12 11:58:01,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:01,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:01,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 11:58:01,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1941434810, now seen corresponding path program 2 times [2022-12-12 11:58:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:01,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517687152] [2022-12-12 11:58:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:01,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517687152] [2022-12-12 11:58:01,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517687152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:01,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:01,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:58:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937982706] [2022-12-12 11:58:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:01,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:58:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:58:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:58:01,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 90 [2022-12-12 11:58:01,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 2630 transitions, 31682 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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) [2022-12-12 11:58:01,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:01,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 90 [2022-12-12 11:58:01,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:03,158 INFO L130 PetriNetUnfolder]: 1309/3902 cut-off events. [2022-12-12 11:58:03,159 INFO L131 PetriNetUnfolder]: For 15915/16546 co-relation queries the response was YES. [2022-12-12 11:58:03,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14464 conditions, 3902 events. 1309/3902 cut-off events. For 15915/16546 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 34923 event pairs, 55 based on Foata normal form. 129/3957 useless extension candidates. Maximal degree in co-relation 14407. Up to 895 conditions per place. [2022-12-12 11:58:03,176 INFO L137 encePairwiseOnDemand]: 81/90 looper letters, 56 selfloop transitions, 5 changer transitions 760/893 dead transitions. [2022-12-12 11:58:03,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 893 transitions, 11288 flow [2022-12-12 11:58:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:58:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:58:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 750 transitions. [2022-12-12 11:58:03,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-12-12 11:58:03,179 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 98 predicate places. [2022-12-12 11:58:03,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 893 transitions, 11288 flow [2022-12-12 11:58:03,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 893 transitions, 9639 flow, removed 794 selfloop flow, removed 7 redundant places. [2022-12-12 11:58:03,205 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 893 transitions, 9639 flow [2022-12-12 11:58:03,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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) [2022-12-12 11:58:03,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:03,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:03,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 11:58:03,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1344536612, now seen corresponding path program 1 times [2022-12-12 11:58:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:03,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823290853] [2022-12-12 11:58:03,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:03,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:03,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823290853] [2022-12-12 11:58:03,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823290853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:03,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:03,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:58:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376211553] [2022-12-12 11:58:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:03,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:58:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:03,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:58:03,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:58:03,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 90 [2022-12-12 11:58:03,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 893 transitions, 9639 flow. Second operand has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 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) [2022-12-12 11:58:03,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:03,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 90 [2022-12-12 11:58:03,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:03,984 INFO L130 PetriNetUnfolder]: 979/2490 cut-off events. [2022-12-12 11:58:03,984 INFO L131 PetriNetUnfolder]: For 10958/11845 co-relation queries the response was YES. [2022-12-12 11:58:03,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10031 conditions, 2490 events. 979/2490 cut-off events. For 10958/11845 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20363 event pairs, 48 based on Foata normal form. 122/2581 useless extension candidates. Maximal degree in co-relation 9974. Up to 422 conditions per place. [2022-12-12 11:58:03,994 INFO L137 encePairwiseOnDemand]: 81/90 looper letters, 35 selfloop transitions, 7 changer transitions 379/483 dead transitions. [2022-12-12 11:58:03,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 483 transitions, 6161 flow [2022-12-12 11:58:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:58:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:58:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2022-12-12 11:58:04,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8051282051282052 [2022-12-12 11:58:04,002 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 52 predicate places. [2022-12-12 11:58:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 483 transitions, 6161 flow [2022-12-12 11:58:04,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 483 transitions, 4810 flow, removed 598 selfloop flow, removed 8 redundant places. [2022-12-12 11:58:04,020 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 483 transitions, 4810 flow [2022-12-12 11:58:04,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 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) [2022-12-12 11:58:04,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:04,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:04,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 11:58:04,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1514419813, now seen corresponding path program 1 times [2022-12-12 11:58:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:04,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083158923] [2022-12-12 11:58:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:58:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:58:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:58:05,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083158923] [2022-12-12 11:58:05,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083158923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:58:05,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:58:05,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 11:58:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310560724] [2022-12-12 11:58:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:58:05,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 11:58:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:58:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 11:58:05,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-12 11:58:05,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 90 [2022-12-12 11:58:05,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 483 transitions, 4810 flow. Second operand has 14 states, 14 states have (on average 62.714285714285715) internal successors, (878), 14 states have internal predecessors, (878), 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) [2022-12-12 11:58:05,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:58:05,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 90 [2022-12-12 11:58:05,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:58:06,070 INFO L130 PetriNetUnfolder]: 1068/2821 cut-off events. [2022-12-12 11:58:06,071 INFO L131 PetriNetUnfolder]: For 9256/9719 co-relation queries the response was YES. [2022-12-12 11:58:06,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 2821 events. 1068/2821 cut-off events. For 9256/9719 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24185 event pairs, 58 based on Foata normal form. 185/2985 useless extension candidates. Maximal degree in co-relation 10010. Up to 444 conditions per place. [2022-12-12 11:58:06,080 INFO L137 encePairwiseOnDemand]: 78/90 looper letters, 28 selfloop transitions, 8 changer transitions 426/515 dead transitions. [2022-12-12 11:58:06,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 515 transitions, 6004 flow [2022-12-12 11:58:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 11:58:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 11:58:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 905 transitions. [2022-12-12 11:58:06,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7182539682539683 [2022-12-12 11:58:06,083 INFO L295 CegarLoopForPetriNet]: 93 programPoint places, 57 predicate places. [2022-12-12 11:58:06,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 515 transitions, 6004 flow [2022-12-12 11:58:06,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 515 transitions, 5608 flow, removed 163 selfloop flow, removed 4 redundant places. [2022-12-12 11:58:06,096 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 515 transitions, 5608 flow [2022-12-12 11:58:06,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.714285714285715) internal successors, (878), 14 states have internal predecessors, (878), 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) [2022-12-12 11:58:06,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:58:06,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:06,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 11:58:06,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:58:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:58:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1024668571, now seen corresponding path program 2 times [2022-12-12 11:58:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:58:06,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887284542] [2022-12-12 11:58:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:58:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:58:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:58:06,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:58:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:58:06,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:58:06,248 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:58:06,249 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 11:58:06,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 11:58:06,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 11:58:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 11:58:06,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 11:58:06,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 11:58:06,253 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-12 11:58:06,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:58:06,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:58:06,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:58:06 BasicIcfg [2022-12-12 11:58:06,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:58:06,349 INFO L158 Benchmark]: Toolchain (without parser) took 26362.00ms. Allocated memory was 186.6MB in the beginning and 716.2MB in the end (delta: 529.5MB). Free memory was 161.1MB in the beginning and 642.5MB in the end (delta: -481.4MB). Peak memory consumption was 49.0MB. Max. memory is 8.0GB. [2022-12-12 11:58:06,349 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 186.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:58:06,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.37ms. Allocated memory is still 186.6MB. Free memory was 161.1MB in the beginning and 133.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 11:58:06,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.06ms. Allocated memory is still 186.6MB. Free memory was 133.1MB in the beginning and 130.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:58:06,350 INFO L158 Benchmark]: Boogie Preprocessor took 57.31ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:58:06,350 INFO L158 Benchmark]: RCFGBuilder took 645.76ms. Allocated memory is still 186.6MB. Free memory was 128.4MB in the beginning and 82.8MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-12 11:58:06,350 INFO L158 Benchmark]: TraceAbstraction took 24966.96ms. Allocated memory was 186.6MB in the beginning and 716.2MB in the end (delta: 529.5MB). Free memory was 81.7MB in the beginning and 642.5MB in the end (delta: -560.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:58:06,351 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.15ms. Allocated memory is still 186.6MB. Free memory is still 162.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 608.37ms. Allocated memory is still 186.6MB. Free memory was 161.1MB in the beginning and 133.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.06ms. Allocated memory is still 186.6MB. Free memory was 133.1MB in the beginning and 130.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.31ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 645.76ms. Allocated memory is still 186.6MB. Free memory was 128.4MB in the beginning and 82.8MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 24966.96ms. Allocated memory was 186.6MB in the beginning and 716.2MB in the end (delta: 529.5MB). Free memory was 81.7MB in the beginning and 642.5MB in the end (delta: -560.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L720] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L721] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L722] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L723] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L728] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L729] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L730] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L731] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L732] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 pthread_t t1585; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 827]: 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: 829]: 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, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1046 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1046 mSDsluCounter, 1036 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 851 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2408 IncrementalHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 185 mSDtfsCounter, 2408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31682occurred in iteration=9, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 9084 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 839 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 5225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! [2022-12-12 11:58:06,368 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...