/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:02:08,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:02:08,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:02:08,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:02:08,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:02:08,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:02:08,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:02:09,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:02:09,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:02:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:02:09,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:02:09,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:02:09,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:02:09,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:02:09,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:02:09,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:02:09,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:02:09,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:02:09,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:02:09,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:02:09,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:02:09,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:02:09,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:02:09,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:02:09,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:02:09,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:02:09,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:02:09,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:02:09,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:02:09,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:02:09,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:02:09,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:02:09,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:02:09,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:02:09,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:02:09,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:02:09,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:02:09,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:02:09,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:02:09,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:02:09,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:02:09,040 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-11 21:02:09,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:02:09,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:02:09,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:02:09,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:02:09,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:02:09,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:02:09,067 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:02:09,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:02:09,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:02:09,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:02:09,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:02:09,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:02:09,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:02:09,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:02:09,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:02:09,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:02:09,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:02:09,070 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 [2022-12-11 21:02:09,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:02:09,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:02:09,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:02:09,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:02:09,415 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:02:09,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:02:10,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:02:10,748 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:02:10,748 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:02:10,768 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2cfeeb2e/a3177efd85424f7ba867c896b52cdc59/FLAG7d66258f0 [2022-12-11 21:02:10,782 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2cfeeb2e/a3177efd85424f7ba867c896b52cdc59 [2022-12-11 21:02:10,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:02:10,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:02:10,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:02:10,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:02:10,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:02:10,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:02:10" (1/1) ... [2022-12-11 21:02:10,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170b2c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:10, skipping insertion in model container [2022-12-11 21:02:10,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:02:10" (1/1) ... [2022-12-11 21:02:10,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:02:10,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:02:10,985 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 21:02:11,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:02:11,177 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:02:11,190 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/rfi001_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-11 21:02:11,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:02:11,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:02:11,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:02:11,277 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:02:11,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11 WrapperNode [2022-12-11 21:02:11,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:02:11,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:02:11,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:02:11,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:02:11,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,332 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-11 21:02:11,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:02:11,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:02:11,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:02:11,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:02:11,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:02:11,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:02:11,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:02:11,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:02:11,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (1/1) ... [2022-12-11 21:02:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:02:11,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:02:11,397 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-11 21:02:11,422 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-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:02:11,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:02:11,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:02:11,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:02:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:02:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:02:11,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:02:11,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:02:11,436 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:02:11,530 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:02:11,531 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:02:11,764 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:02:11,876 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:02:11,877 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:02:11,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:02:11 BoogieIcfgContainer [2022-12-11 21:02:11,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:02:11,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:02:11,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:02:11,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:02:11,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:02:10" (1/3) ... [2022-12-11 21:02:11,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627f5c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:02:11, skipping insertion in model container [2022-12-11 21:02:11,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:02:11" (2/3) ... [2022-12-11 21:02:11,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627f5c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:02:11, skipping insertion in model container [2022-12-11 21:02:11,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:02:11" (3/3) ... [2022-12-11 21:02:11,884 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2022-12-11 21:02:11,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:02:11,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:02:11,897 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:02:11,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:02:11,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-11 21:02:12,001 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-11 21:02:12,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:02:12,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-11 21:02:12,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-11 21:02:12,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-11 21:02:12,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:02:12,023 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;@25a8f252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:02:12,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 21:02:12,038 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-11 21:02:12,038 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:02:12,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:12,039 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] [2022-12-11 21:02:12,040 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-11 21:02:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 162755724, now seen corresponding path program 1 times [2022-12-11 21:02:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:12,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534808068] [2022-12-11 21:02:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:12,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:12,479 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-11 21:02:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534808068] [2022-12-11 21:02:12,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534808068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:12,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:12,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:02:12,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387993116] [2022-12-11 21:02:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:12,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:02:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:12,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:02:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:02:12,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2022-12-11 21:02:12,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-11 21:02:12,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:12,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2022-12-11 21:02:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:12,612 INFO L130 PetriNetUnfolder]: 18/144 cut-off events. [2022-12-11 21:02:12,612 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 21:02:12,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 144 events. 18/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 377 event pairs, 2 based on Foata normal form. 12/147 useless extension candidates. Maximal degree in co-relation 150. Up to 31 conditions per place. [2022-12-11 21:02:12,614 INFO L137 encePairwiseOnDemand]: 86/91 looper letters, 10 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2022-12-11 21:02:12,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 211 flow [2022-12-11 21:02:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:02:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:02:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2022-12-11 21:02:12,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2022-12-11 21:02:12,663 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2022-12-11 21:02:12,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 211 flow [2022-12-11 21:02:12,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 211 flow [2022-12-11 21:02:12,665 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 211 flow [2022-12-11 21:02:12,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-11 21:02:12,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:12,666 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] [2022-12-11 21:02:12,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:02:12,666 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-11 21:02:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -130758165, now seen corresponding path program 1 times [2022-12-11 21:02:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:12,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835020657] [2022-12-11 21:02:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:13,013 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-11 21:02:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835020657] [2022-12-11 21:02:13,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835020657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:13,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:13,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:02:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801045390] [2022-12-11 21:02:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:02:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:02:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:02:13,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2022-12-11 21:02:13,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 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-11 21:02:13,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:13,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2022-12-11 21:02:13,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:13,473 INFO L130 PetriNetUnfolder]: 370/1085 cut-off events. [2022-12-11 21:02:13,473 INFO L131 PetriNetUnfolder]: For 209/417 co-relation queries the response was YES. [2022-12-11 21:02:13,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 1085 events. 370/1085 cut-off events. For 209/417 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7152 event pairs, 55 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 2051. Up to 302 conditions per place. [2022-12-11 21:02:13,484 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 32 selfloop transitions, 4 changer transitions 68/162 dead transitions. [2022-12-11 21:02:13,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 162 transitions, 633 flow [2022-12-11 21:02:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:02:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:02:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 960 transitions. [2022-12-11 21:02:13,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8114961961115807 [2022-12-11 21:02:13,492 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2022-12-11 21:02:13,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 162 transitions, 633 flow [2022-12-11 21:02:13,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 94 transitions, 309 flow [2022-12-11 21:02:13,497 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 309 flow [2022-12-11 21:02:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 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-11 21:02:13,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:13,498 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-11 21:02:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:02:13,498 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-11 21:02:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1336555187, now seen corresponding path program 1 times [2022-12-11 21:02:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946760011] [2022-12-11 21:02:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:13,714 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-11 21:02:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:13,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946760011] [2022-12-11 21:02:13,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946760011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:13,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:13,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:02:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584670057] [2022-12-11 21:02:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:13,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:02:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:02:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:02:13,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-11 21:02:13,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 309 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-11 21:02:13,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:13,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-11 21:02:13,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:13,939 INFO L130 PetriNetUnfolder]: 410/993 cut-off events. [2022-12-11 21:02:13,939 INFO L131 PetriNetUnfolder]: For 854/915 co-relation queries the response was YES. [2022-12-11 21:02:13,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 993 events. 410/993 cut-off events. For 854/915 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5934 event pairs, 27 based on Foata normal form. 21/973 useless extension candidates. Maximal degree in co-relation 2426. Up to 322 conditions per place. [2022-12-11 21:02:13,942 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 38 selfloop transitions, 6 changer transitions 65/174 dead transitions. [2022-12-11 21:02:13,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 174 transitions, 918 flow [2022-12-11 21:02:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:02:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:02:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 771 transitions. [2022-12-11 21:02:13,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8472527472527472 [2022-12-11 21:02:13,945 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2022-12-11 21:02:13,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 174 transitions, 918 flow [2022-12-11 21:02:13,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 109 transitions, 470 flow [2022-12-11 21:02:13,947 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 109 transitions, 470 flow [2022-12-11 21:02:13,948 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-11 21:02:13,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:13,948 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-11 21:02:13,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:02:13,948 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-11 21:02:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1714596585, now seen corresponding path program 1 times [2022-12-11 21:02:13,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:13,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761142546] [2022-12-11 21:02:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:14,135 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-11 21:02:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:14,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761142546] [2022-12-11 21:02:14,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761142546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:14,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:14,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:02:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852573714] [2022-12-11 21:02:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:02:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:14,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:02:14,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:02:14,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-11 21:02:14,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 109 transitions, 470 flow. Second operand has 7 states, 7 states have (on average 71.85714285714286) internal successors, (503), 7 states have internal predecessors, (503), 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-11 21:02:14,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:14,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-11 21:02:14,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:14,287 INFO L130 PetriNetUnfolder]: 97/399 cut-off events. [2022-12-11 21:02:14,287 INFO L131 PetriNetUnfolder]: For 357/437 co-relation queries the response was YES. [2022-12-11 21:02:14,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 399 events. 97/399 cut-off events. For 357/437 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2105 event pairs, 18 based on Foata normal form. 12/395 useless extension candidates. Maximal degree in co-relation 1074. Up to 107 conditions per place. [2022-12-11 21:02:14,289 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 25 selfloop transitions, 9 changer transitions 33/128 dead transitions. [2022-12-11 21:02:14,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 128 transitions, 720 flow [2022-12-11 21:02:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:02:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:02:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 818 transitions. [2022-12-11 21:02:14,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8171828171828172 [2022-12-11 21:02:14,291 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2022-12-11 21:02:14,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 128 transitions, 720 flow [2022-12-11 21:02:14,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 95 transitions, 434 flow [2022-12-11 21:02:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 95 transitions, 434 flow [2022-12-11 21:02:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.85714285714286) internal successors, (503), 7 states have internal predecessors, (503), 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-11 21:02:14,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:14,294 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, 1] [2022-12-11 21:02:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:02:14,294 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-11 21:02:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1082051136, now seen corresponding path program 1 times [2022-12-11 21:02:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:14,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970613175] [2022-12-11 21:02:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:14,499 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-11 21:02:14,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:14,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970613175] [2022-12-11 21:02:14,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970613175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:14,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:14,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:02:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158255696] [2022-12-11 21:02:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:02:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:02:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:02:14,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2022-12-11 21:02:14,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 95 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:02:14,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:14,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2022-12-11 21:02:14,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:14,634 INFO L130 PetriNetUnfolder]: 68/408 cut-off events. [2022-12-11 21:02:14,634 INFO L131 PetriNetUnfolder]: For 475/589 co-relation queries the response was YES. [2022-12-11 21:02:14,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 408 events. 68/408 cut-off events. For 475/589 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2467 event pairs, 16 based on Foata normal form. 13/410 useless extension candidates. Maximal degree in co-relation 1173. Up to 87 conditions per place. [2022-12-11 21:02:14,636 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 22 selfloop transitions, 5 changer transitions 25/112 dead transitions. [2022-12-11 21:02:14,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 112 transitions, 659 flow [2022-12-11 21:02:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 21:02:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 21:02:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 502 transitions. [2022-12-11 21:02:14,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7880690737833596 [2022-12-11 21:02:14,637 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 13 predicate places. [2022-12-11 21:02:14,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 112 transitions, 659 flow [2022-12-11 21:02:14,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 87 transitions, 437 flow [2022-12-11 21:02:14,639 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 437 flow [2022-12-11 21:02:14,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 21:02:14,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:14,639 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, 1] [2022-12-11 21:02:14,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:02:14,639 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-11 21:02:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash 642712706, now seen corresponding path program 2 times [2022-12-11 21:02:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:14,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420310850] [2022-12-11 21:02:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:02:15,075 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-11 21:02:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:02:15,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420310850] [2022-12-11 21:02:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420310850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:02:15,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:02:15,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:02:15,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341724190] [2022-12-11 21:02:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:02:15,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:02:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:02:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:02:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:02:15,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2022-12-11 21:02:15,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 437 flow. Second operand has 9 states, 9 states have (on average 68.22222222222223) internal successors, (614), 9 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-11 21:02:15,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:02:15,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2022-12-11 21:02:15,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:02:15,215 INFO L130 PetriNetUnfolder]: 32/207 cut-off events. [2022-12-11 21:02:15,215 INFO L131 PetriNetUnfolder]: For 424/505 co-relation queries the response was YES. [2022-12-11 21:02:15,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 207 events. 32/207 cut-off events. For 424/505 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 699 event pairs, 7 based on Foata normal form. 8/210 useless extension candidates. Maximal degree in co-relation 560. Up to 47 conditions per place. [2022-12-11 21:02:15,216 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 20 selfloop transitions, 5 changer transitions 13/97 dead transitions. [2022-12-11 21:02:15,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 97 transitions, 612 flow [2022-12-11 21:02:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:02:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:02:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 691 transitions. [2022-12-11 21:02:15,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7593406593406593 [2022-12-11 21:02:15,219 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 14 predicate places. [2022-12-11 21:02:15,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 97 transitions, 612 flow [2022-12-11 21:02:15,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 84 transitions, 448 flow [2022-12-11 21:02:15,220 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 448 flow [2022-12-11 21:02:15,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 68.22222222222223) internal successors, (614), 9 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-11 21:02:15,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:02:15,221 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, 1] [2022-12-11 21:02:15,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:02:15,221 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-11 21:02:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:02:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1822101592, now seen corresponding path program 3 times [2022-12-11 21:02:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:02:15,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885753880] [2022-12-11 21:02:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:02:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:02:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:02:15,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:02:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:02:15,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:02:15,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:02:15,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 21:02:15,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-11 21:02:15,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 21:02:15,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 21:02:15,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-11 21:02:15,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:02:15,297 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-11 21:02:15,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:02:15,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:02:15,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:02:15 BasicIcfg [2022-12-11 21:02:15,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:02:15,363 INFO L158 Benchmark]: Toolchain (without parser) took 4577.53ms. Allocated memory was 226.5MB in the beginning and 368.1MB in the end (delta: 141.6MB). Free memory was 201.2MB in the beginning and 248.0MB in the end (delta: -46.8MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,363 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 202.4MB in the beginning and 202.3MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:02:15,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.20ms. Allocated memory is still 226.5MB. Free memory was 201.0MB in the beginning and 175.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.00ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 173.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,364 INFO L158 Benchmark]: Boogie Preprocessor took 28.43ms. Allocated memory is still 226.5MB. Free memory was 173.2MB in the beginning and 171.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,364 INFO L158 Benchmark]: RCFGBuilder took 516.53ms. Allocated memory is still 226.5MB. Free memory was 171.6MB in the beginning and 139.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,364 INFO L158 Benchmark]: TraceAbstraction took 3482.31ms. Allocated memory was 226.5MB in the beginning and 368.1MB in the end (delta: 141.6MB). Free memory was 138.6MB in the beginning and 248.0MB in the end (delta: -109.5MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2022-12-11 21:02:15,366 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 202.4MB in the beginning and 202.3MB in the end (delta: 79.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.20ms. Allocated memory is still 226.5MB. Free memory was 201.0MB in the beginning and 175.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.00ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 173.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.43ms. Allocated memory is still 226.5MB. Free memory was 173.2MB in the beginning and 171.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 516.53ms. Allocated memory is still 226.5MB. Free memory was 171.6MB in the beginning and 139.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3482.31ms. Allocated memory was 226.5MB in the beginning and 368.1MB in the end (delta: 141.6MB). Free memory was 138.6MB in the beginning and 248.0MB in the end (delta: -109.5MB). Peak memory consumption was 32.6MB. 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] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L735] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1601, ((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(&t1601, ((void *)0), P0, ((void *)0))=-1, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 1 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L818] FCALL, FORK 0 pthread_create(&t1602, ((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(&t1602, ((void *)0), P1, ((void *)0))=0, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L768] 2 y = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L771] 2 z = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L774] 2 __unbuffered_p1_EAX = z 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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$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=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L822] 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=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 534 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 53 mSDtfsCounter, 534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=3, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 1444 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 1544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-11 21:02:15,380 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...