/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:22:58,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:22:58,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:22:58,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:22:58,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:22:58,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:22:58,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:22:58,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:22:58,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:22:59,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:22:59,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:22:59,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:22:59,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:22:59,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:22:59,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:22:59,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:22:59,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:22:59,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:22:59,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:22:59,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:22:59,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:22:59,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:22:59,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:22:59,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:22:59,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:22:59,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:22:59,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:22:59,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:22:59,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:22:59,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:22:59,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:22:59,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:22:59,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:22:59,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:22:59,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:22:59,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:22:59,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:22:59,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:22:59,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:22:59,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:22:59,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:22:59,043 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-SemanticLbe.epf [2022-12-05 20:22:59,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:22:59,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:22:59,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:22:59,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:22:59,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:22:59,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:22:59,079 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:22:59,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:22:59,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:22:59,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:22:59,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:22:59,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:22:59,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:22:59,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:22:59,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:22:59,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:22:59,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:59,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:22:59,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:22:59,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:22:59,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:22:59,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:22:59,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:22:59,083 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 [2022-12-05 20:22:59,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:22:59,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:22:59,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:22:59,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:22:59,447 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:22:59,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:23:00,667 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:23:00,957 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:23:00,958 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:23:00,986 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfb64332/79e1fc1f53724870b38a175f579733ab/FLAGf47009404 [2022-12-05 20:23:01,009 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfb64332/79e1fc1f53724870b38a175f579733ab [2022-12-05 20:23:01,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:23:01,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:23:01,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:01,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:23:01,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:23:01,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8623dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01, skipping insertion in model container [2022-12-05 20:23:01,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:23:01,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:23:01,249 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:23:01,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:01,503 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:23:01,514 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/mix038_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:23:01,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:23:01,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:23:01,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:23:01,633 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:23:01,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01 WrapperNode [2022-12-05 20:23:01,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:23:01,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:01,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:23:01,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:23:01,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,695 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-05 20:23:01,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:23:01,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:23:01,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:23:01,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:23:01,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,740 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:23:01,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:23:01,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:23:01,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:23:01,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (1/1) ... [2022-12-05 20:23:01,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:23:01,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:23:01,791 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-05 20:23:01,807 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-05 20:23:01,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:23:01,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:23:01,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:23:01,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:23:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:23:01,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:23:01,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:23:01,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:23:01,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:23:01,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:23:01,842 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:23:02,015 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:23:02,017 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:23:02,370 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:23:02,497 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:23:02,497 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:23:02,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:02 BoogieIcfgContainer [2022-12-05 20:23:02,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:23:02,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:23:02,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:23:02,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:23:02,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:23:01" (1/3) ... [2022-12-05 20:23:02,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183005ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:02, skipping insertion in model container [2022-12-05 20:23:02,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:23:01" (2/3) ... [2022-12-05 20:23:02,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183005ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:23:02, skipping insertion in model container [2022-12-05 20:23:02,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:23:02" (3/3) ... [2022-12-05 20:23:02,507 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:23:02,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:23:02,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:23:02,524 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:23:02,576 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:23:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:23:02,670 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:23:02,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:02,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:23:02,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-05 20:23:02,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:02,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:23:02,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:02,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:02,753 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-05 20:23:02,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:02,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:23:02,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-05 20:23:02,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-05 20:23:07,118 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-05 20:23:07,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:23:07,143 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;@16098b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:23:07,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:23:07,145 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:23:07,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:23:07,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:07,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:23:07,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash 486260, now seen corresponding path program 1 times [2022-12-05 20:23:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:07,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620017897] [2022-12-05 20:23:07,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:07,522 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-05 20:23:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:07,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620017897] [2022-12-05 20:23:07,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620017897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:07,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:07,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:07,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557335182] [2022-12-05 20:23:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:07,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:07,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:07,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:07,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 20:23:07,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 20:23:07,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:07,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 20:23:07,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:07,928 INFO L130 PetriNetUnfolder]: 1106/1786 cut-off events. [2022-12-05 20:23:07,928 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 20:23:07,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 1786 events. 1106/1786 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9880 event pairs, 176 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 3469. Up to 1336 conditions per place. [2022-12-05 20:23:07,941 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-05 20:23:07,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2022-12-05 20:23:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-05 20:23:07,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-05 20:23:07,954 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-05 20:23:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2022-12-05 20:23:07,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:07,958 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-05 20:23:07,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 20:23:07,963 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 20:23:07,963 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 54 flow [2022-12-05 20:23:07,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 20:23:07,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:07,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:07,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:23:07,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:07,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1314408240, now seen corresponding path program 1 times [2022-12-05 20:23:07,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:07,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481204409] [2022-12-05 20:23:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:07,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:08,175 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-05 20:23:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:08,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481204409] [2022-12-05 20:23:08,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481204409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:08,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:08,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:23:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582166027] [2022-12-05 20:23:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:08,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:08,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:08,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 20:23:08,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 20:23:08,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:08,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 20:23:08,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:08,548 INFO L130 PetriNetUnfolder]: 2001/3012 cut-off events. [2022-12-05 20:23:08,548 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-05 20:23:08,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 3012 events. 2001/3012 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14407 event pairs, 651 based on Foata normal form. 94/3106 useless extension candidates. Maximal degree in co-relation 6234. Up to 2040 conditions per place. [2022-12-05 20:23:08,565 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-05 20:23:08,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 170 flow [2022-12-05 20:23:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 20:23:08,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2022-12-05 20:23:08,566 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 54 flow. Second operand 3 states and 40 transitions. [2022-12-05 20:23:08,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 170 flow [2022-12-05 20:23:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:08,568 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2022-12-05 20:23:08,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-05 20:23:08,569 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-05 20:23:08,569 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2022-12-05 20:23:08,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 20:23:08,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:08,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:08,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:23:08,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2091949392, now seen corresponding path program 1 times [2022-12-05 20:23:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:08,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472671844] [2022-12-05 20:23:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:08,699 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-05 20:23:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472671844] [2022-12-05 20:23:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472671844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:08,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:08,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543524287] [2022-12-05 20:23:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:08,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 20:23:08,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-05 20:23:08,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:08,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 20:23:08,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:09,106 INFO L130 PetriNetUnfolder]: 1865/2812 cut-off events. [2022-12-05 20:23:09,107 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2022-12-05 20:23:09,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2812 events. 1865/2812 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12793 event pairs, 553 based on Foata normal form. 40/2852 useless extension candidates. Maximal degree in co-relation 6940. Up to 1428 conditions per place. [2022-12-05 20:23:09,126 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-05 20:23:09,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 240 flow [2022-12-05 20:23:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:23:09,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2022-12-05 20:23:09,130 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:23:09,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 240 flow [2022-12-05 20:23:09,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:09,138 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 132 flow [2022-12-05 20:23:09,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-05 20:23:09,139 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-05 20:23:09,139 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 132 flow [2022-12-05 20:23:09,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-05 20:23:09,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:09,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:23:09,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -473883939, now seen corresponding path program 1 times [2022-12-05 20:23:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:09,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522739720] [2022-12-05 20:23:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:09,280 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-05 20:23:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:09,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522739720] [2022-12-05 20:23:09,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522739720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:09,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:09,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801828292] [2022-12-05 20:23:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:09,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:09,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 20:23:09,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 132 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:23:09,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:09,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 20:23:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:09,632 INFO L130 PetriNetUnfolder]: 1826/2753 cut-off events. [2022-12-05 20:23:09,632 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2022-12-05 20:23:09,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2753 events. 1826/2753 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13073 event pairs, 350 based on Foata normal form. 8/2761 useless extension candidates. Maximal degree in co-relation 7246. Up to 1795 conditions per place. [2022-12-05 20:23:09,652 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 43 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2022-12-05 20:23:09,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 322 flow [2022-12-05 20:23:09,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 20:23:09,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2022-12-05 20:23:09,654 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 132 flow. Second operand 4 states and 52 transitions. [2022-12-05 20:23:09,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 322 flow [2022-12-05 20:23:09,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:09,660 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 201 flow [2022-12-05 20:23:09,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-05 20:23:09,661 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-05 20:23:09,661 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 201 flow [2022-12-05 20:23:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:23:09,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:09,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:09,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:23:09,662 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1805411487, now seen corresponding path program 1 times [2022-12-05 20:23:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:09,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773269709] [2022-12-05 20:23:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:09,814 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-05 20:23:09,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:09,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773269709] [2022-12-05 20:23:09,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773269709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:09,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:09,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:23:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600840432] [2022-12-05 20:23:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:09,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:23:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:23:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:23:09,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 20:23:09,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-05 20:23:09,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:09,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 20:23:09,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:10,029 INFO L130 PetriNetUnfolder]: 740/1286 cut-off events. [2022-12-05 20:23:10,029 INFO L131 PetriNetUnfolder]: For 1162/1224 co-relation queries the response was YES. [2022-12-05 20:23:10,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1286 events. 740/1286 cut-off events. For 1162/1224 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6554 event pairs, 189 based on Foata normal form. 89/1352 useless extension candidates. Maximal degree in co-relation 3452. Up to 989 conditions per place. [2022-12-05 20:23:10,040 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 38 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-12-05 20:23:10,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 361 flow [2022-12-05 20:23:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:23:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:23:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 20:23:10,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2022-12-05 20:23:10,042 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 201 flow. Second operand 3 states and 43 transitions. [2022-12-05 20:23:10,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 361 flow [2022-12-05 20:23:10,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 359 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 20:23:10,048 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 225 flow [2022-12-05 20:23:10,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-05 20:23:10,050 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-05 20:23:10,050 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 225 flow [2022-12-05 20:23:10,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-05 20:23:10,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:10,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:10,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:23:10,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash 671671113, now seen corresponding path program 1 times [2022-12-05 20:23:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:10,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507605186] [2022-12-05 20:23:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:10,240 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-05 20:23:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507605186] [2022-12-05 20:23:10,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507605186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:10,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:10,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106585511] [2022-12-05 20:23:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:10,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 20:23:10,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05 20:23:10,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:10,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 20:23:10,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:10,406 INFO L130 PetriNetUnfolder]: 371/712 cut-off events. [2022-12-05 20:23:10,406 INFO L131 PetriNetUnfolder]: For 657/682 co-relation queries the response was YES. [2022-12-05 20:23:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 712 events. 371/712 cut-off events. For 657/682 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3435 event pairs, 114 based on Foata normal form. 87/782 useless extension candidates. Maximal degree in co-relation 2242. Up to 235 conditions per place. [2022-12-05 20:23:10,413 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 49 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2022-12-05 20:23:10,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 467 flow [2022-12-05 20:23:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 20:23:10,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:23:10,415 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 225 flow. Second operand 4 states and 58 transitions. [2022-12-05 20:23:10,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 467 flow [2022-12-05 20:23:10,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:23:10,418 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 261 flow [2022-12-05 20:23:10,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-05 20:23:10,419 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-05 20:23:10,419 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 261 flow [2022-12-05 20:23:10,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05 20:23:10,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:10,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:10,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:23:10,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 112072938, now seen corresponding path program 1 times [2022-12-05 20:23:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345239506] [2022-12-05 20:23:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:10,628 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-05 20:23:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:10,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345239506] [2022-12-05 20:23:10,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345239506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:10,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:10,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647517937] [2022-12-05 20:23:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:10,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:10,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 20:23:10,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 261 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-05 20:23:10,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:10,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 20:23:10,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:10,828 INFO L130 PetriNetUnfolder]: 626/1117 cut-off events. [2022-12-05 20:23:10,828 INFO L131 PetriNetUnfolder]: For 1983/1983 co-relation queries the response was YES. [2022-12-05 20:23:10,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3928 conditions, 1117 events. 626/1117 cut-off events. For 1983/1983 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5291 event pairs, 145 based on Foata normal form. 10/1127 useless extension candidates. Maximal degree in co-relation 3905. Up to 607 conditions per place. [2022-12-05 20:23:10,836 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 47 selfloop transitions, 9 changer transitions 10/66 dead transitions. [2022-12-05 20:23:10,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 506 flow [2022-12-05 20:23:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-05 20:23:10,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4051724137931034 [2022-12-05 20:23:10,837 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 261 flow. Second operand 4 states and 47 transitions. [2022-12-05 20:23:10,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 506 flow [2022-12-05 20:23:10,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 480 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 20:23:10,844 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 244 flow [2022-12-05 20:23:10,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-05 20:23:10,845 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-05 20:23:10,845 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 244 flow [2022-12-05 20:23:10,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-05 20:23:10,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:10,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:10,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:23:10,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash -954586473, now seen corresponding path program 1 times [2022-12-05 20:23:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:10,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863776791] [2022-12-05 20:23:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:11,029 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-05 20:23:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863776791] [2022-12-05 20:23:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863776791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:11,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:11,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:23:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651812410] [2022-12-05 20:23:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:11,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:23:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:23:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:23:11,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:23:11,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:23:11,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:11,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:23:11,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:11,258 INFO L130 PetriNetUnfolder]: 576/1127 cut-off events. [2022-12-05 20:23:11,259 INFO L131 PetriNetUnfolder]: For 1654/1668 co-relation queries the response was YES. [2022-12-05 20:23:11,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 1127 events. 576/1127 cut-off events. For 1654/1668 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6096 event pairs, 164 based on Foata normal form. 14/1131 useless extension candidates. Maximal degree in co-relation 3652. Up to 520 conditions per place. [2022-12-05 20:23:11,266 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 41 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2022-12-05 20:23:11,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 502 flow [2022-12-05 20:23:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:23:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:23:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:23:11,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-05 20:23:11,267 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 244 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:23:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 502 flow [2022-12-05 20:23:11,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 466 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:11,272 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 222 flow [2022-12-05 20:23:11,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-05 20:23:11,273 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-05 20:23:11,273 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 222 flow [2022-12-05 20:23:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:23:11,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:11,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:11,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:23:11,274 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash -756097063, now seen corresponding path program 2 times [2022-12-05 20:23:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:11,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383939909] [2022-12-05 20:23:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:11,488 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-05 20:23:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:11,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383939909] [2022-12-05 20:23:11,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383939909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:11,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:11,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:23:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69842681] [2022-12-05 20:23:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:11,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:23:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:11,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:23:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:23:11,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 20:23:11,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-05 20:23:11,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:11,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 20:23:11,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:11,664 INFO L130 PetriNetUnfolder]: 419/826 cut-off events. [2022-12-05 20:23:11,664 INFO L131 PetriNetUnfolder]: For 838/854 co-relation queries the response was YES. [2022-12-05 20:23:11,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 826 events. 419/826 cut-off events. For 838/854 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4422 event pairs, 134 based on Foata normal form. 54/862 useless extension candidates. Maximal degree in co-relation 2610. Up to 327 conditions per place. [2022-12-05 20:23:11,669 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 32 selfloop transitions, 10 changer transitions 17/62 dead transitions. [2022-12-05 20:23:11,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 444 flow [2022-12-05 20:23:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:23:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:23:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-05 20:23:11,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2022-12-05 20:23:11,671 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 222 flow. Second operand 5 states and 61 transitions. [2022-12-05 20:23:11,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 444 flow [2022-12-05 20:23:11,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 429 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 20:23:11,676 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 162 flow [2022-12-05 20:23:11,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2022-12-05 20:23:11,677 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-05 20:23:11,677 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 162 flow [2022-12-05 20:23:11,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-05 20:23:11,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:11,678 INFO L213 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] [2022-12-05 20:23:11,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:23:11,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:11,678 INFO L85 PathProgramCache]: Analyzing trace with hash 810580315, now seen corresponding path program 1 times [2022-12-05 20:23:11,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:11,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593458583] [2022-12-05 20:23:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:23:12,394 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-05 20:23:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:23:12,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593458583] [2022-12-05 20:23:12,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593458583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:23:12,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:23:12,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:23:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915348932] [2022-12-05 20:23:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:23:12,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:23:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:23:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:23:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:23:12,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 20:23:12,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-05 20:23:12,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:23:12,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 20:23:12,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:12,564 INFO L130 PetriNetUnfolder]: 126/266 cut-off events. [2022-12-05 20:23:12,564 INFO L131 PetriNetUnfolder]: For 402/409 co-relation queries the response was YES. [2022-12-05 20:23:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 266 events. 126/266 cut-off events. For 402/409 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 977 event pairs, 14 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 917. Up to 92 conditions per place. [2022-12-05 20:23:12,566 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 28 selfloop transitions, 3 changer transitions 32/66 dead transitions. [2022-12-05 20:23:12,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 496 flow [2022-12-05 20:23:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:23:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:23:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-05 20:23:12,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3399014778325123 [2022-12-05 20:23:12,567 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 162 flow. Second operand 7 states and 69 transitions. [2022-12-05 20:23:12,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 496 flow [2022-12-05 20:23:12,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 400 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-12-05 20:23:12,571 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 126 flow [2022-12-05 20:23:12,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2022-12-05 20:23:12,572 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-05 20:23:12,572 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 126 flow [2022-12-05 20:23:12,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-05 20:23:12,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:23:12,572 INFO L213 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] [2022-12-05 20:23:12,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:23:12,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:23:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:23:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1782639821, now seen corresponding path program 2 times [2022-12-05 20:23:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:23:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105952894] [2022-12-05 20:23:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:23:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:23:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:12,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:23:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:23:12,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:23:12,693 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:23:12,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:23:12,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:23:12,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:23:12,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:23:12,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:23:12,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:23:12,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:23:12,700 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:23:12,706 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:23:12,706 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:23:12,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:23:12 BasicIcfg [2022-12-05 20:23:12,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:23:12,781 INFO L158 Benchmark]: Toolchain (without parser) took 11768.35ms. Allocated memory was 210.8MB in the beginning and 376.4MB in the end (delta: 165.7MB). Free memory was 170.3MB in the beginning and 269.6MB in the end (delta: -99.3MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2022-12-05 20:23:12,781 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 210.8MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:23:12,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.27ms. Allocated memory is still 210.8MB. Free memory was 169.8MB in the beginning and 143.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:23:12,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.22ms. Allocated memory is still 210.8MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:12,782 INFO L158 Benchmark]: Boogie Preprocessor took 52.31ms. Allocated memory is still 210.8MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:23:12,782 INFO L158 Benchmark]: RCFGBuilder took 747.49ms. Allocated memory is still 210.8MB. Free memory was 138.9MB in the beginning and 104.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 20:23:12,782 INFO L158 Benchmark]: TraceAbstraction took 10278.98ms. Allocated memory was 210.8MB in the beginning and 376.4MB in the end (delta: 165.7MB). Free memory was 103.7MB in the beginning and 269.6MB in the end (delta: -165.9MB). Peak memory consumption was 306.8kB. Max. memory is 8.0GB. [2022-12-05 20:23:12,783 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.18ms. Allocated memory is still 210.8MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 618.27ms. Allocated memory is still 210.8MB. Free memory was 169.8MB in the beginning and 143.1MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.22ms. Allocated memory is still 210.8MB. Free memory was 143.1MB in the beginning and 141.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.31ms. Allocated memory is still 210.8MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 747.49ms. Allocated memory is still 210.8MB. Free memory was 138.9MB in the beginning and 104.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10278.98ms. Allocated memory was 210.8MB in the beginning and 376.4MB in the end (delta: 165.7MB). Free memory was 103.7MB in the beginning and 269.6MB in the end (delta: -165.9MB). Peak memory consumption was 306.8kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 117 PlacesBefore, 38 PlacesAfterwards, 109 TransitionsBefore, 29 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 1744, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1804, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1414, independent: 1374, independent conditional: 0, independent unconditional: 1374, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1414, independent: 1363, independent conditional: 0, independent unconditional: 1363, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1804, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1414, unknown conditional: 0, unknown unconditional: 1414] , Statistics on independence cache: Total cache size (in pairs): 2260, Positive cache size: 2220, Positive conditional cache size: 0, Positive unconditional cache size: 2220, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 17 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:23:12,812 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...