/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:39:33,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:39:33,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:39:33,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:39:33,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:39:33,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:39:33,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:39:33,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:39:33,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:39:33,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:39:33,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:39:33,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:39:33,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:39:33,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:39:33,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:39:33,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:39:33,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:39:33,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:39:33,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:39:33,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:39:33,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:39:33,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:39:33,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:39:33,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:39:33,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:39:33,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:39:33,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:39:33,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:39:33,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:39:33,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:39:33,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:39:33,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:39:33,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:39:33,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:39:33,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:39:33,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:39:33,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:39:33,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:39:33,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:39:33,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:39:33,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:39:33,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 18:39:33,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:39:33,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:39:33,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:39:33,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:39:33,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:39:33,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:39:33,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:39:33,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:39:33,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:39:33,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:39:33,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:39:33,728 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 18:39:34,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:39:34,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:39:34,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:39:34,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:39:34,040 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:39:34,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 18:39:35,137 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:39:35,356 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:39:35,356 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 18:39:35,364 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ec0d3a6/24179fad144b4e18b90fe61c77126fa1/FLAGb488a1657 [2022-12-05 18:39:35,377 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ec0d3a6/24179fad144b4e18b90fe61c77126fa1 [2022-12-05 18:39:35,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:39:35,380 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:39:35,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:39:35,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:39:35,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:39:35,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8225ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35, skipping insertion in model container [2022-12-05 18:39:35,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:39:35,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:39:35,550 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-05 18:39:35,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:39:35,744 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:39:35,753 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-05 18:39:35,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:39:35,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:39:35,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:39:35,833 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:39:35,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35 WrapperNode [2022-12-05 18:39:35,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:39:35,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:39:35,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:39:35,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:39:35,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,892 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 18:39:35,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:39:35,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:39:35,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:39:35,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:39:35,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,936 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:39:35,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:39:35,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:39:35,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:39:35,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (1/1) ... [2022-12-05 18:39:35,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:39:35,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:39:36,014 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 18:39:36,046 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 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:39:36,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:39:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:39:36,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:39:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:39:36,066 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 18:39:36,168 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:39:36,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:39:36,559 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:39:36,682 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:39:36,682 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:39:36,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:39:36 BoogieIcfgContainer [2022-12-05 18:39:36,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:39:36,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:39:36,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:39:36,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:39:36,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:39:35" (1/3) ... [2022-12-05 18:39:36,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925b48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:39:36, skipping insertion in model container [2022-12-05 18:39:36,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:39:35" (2/3) ... [2022-12-05 18:39:36,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925b48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:39:36, skipping insertion in model container [2022-12-05 18:39:36,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:39:36" (3/3) ... [2022-12-05 18:39:36,692 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 18:39:36,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:39:36,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:39:36,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:39:36,752 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:39:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 18:39:36,861 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-05 18:39:36,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:39:36,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 18:39:36,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-05 18:39:36,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-05 18:39:36,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:39:36,881 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;@41fc0fe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:39:36,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 18:39:36,892 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-05 18:39:36,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:39:36,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:36,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:36,894 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 18:39:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1542221977, now seen corresponding path program 1 times [2022-12-05 18:39:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097703583] [2022-12-05 18:39:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:37,351 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 18:39:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:37,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097703583] [2022-12-05 18:39:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097703583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:37,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:39:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770200216] [2022-12-05 18:39:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:37,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:39:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:39:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:39:37,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 108 [2022-12-05 18:39:37,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 18:39:37,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:37,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 108 [2022-12-05 18:39:37,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:37,615 INFO L130 PetriNetUnfolder]: 124/522 cut-off events. [2022-12-05 18:39:37,615 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 18:39:37,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 522 events. 124/522 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2840 event pairs, 24 based on Foata normal form. 27/519 useless extension candidates. Maximal degree in co-relation 704. Up to 155 conditions per place. [2022-12-05 18:39:37,623 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 18 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-05 18:39:37,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 273 flow [2022-12-05 18:39:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:39:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:39:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2022-12-05 18:39:37,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9290123456790124 [2022-12-05 18:39:37,638 INFO L175 Difference]: Start difference. First operand has 113 places, 105 transitions, 219 flow. Second operand 3 states and 301 transitions. [2022-12-05 18:39:37,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 273 flow [2022-12-05 18:39:37,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 18:39:37,644 INFO L231 Difference]: Finished difference. Result has 110 places, 101 transitions, 212 flow [2022-12-05 18:39:37,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=110, PETRI_TRANSITIONS=101} [2022-12-05 18:39:37,649 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2022-12-05 18:39:37,649 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 212 flow [2022-12-05 18:39:37,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 18:39:37,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:37,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:37,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:39:37,650 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 18:39:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -271639571, now seen corresponding path program 1 times [2022-12-05 18:39:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:37,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580684910] [2022-12-05 18:39:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:38,032 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 18:39:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:38,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580684910] [2022-12-05 18:39:38,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580684910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:38,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:38,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:39:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96859680] [2022-12-05 18:39:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:39:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:39:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:39:38,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-12-05 18:39:38,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 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 18:39:38,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:38,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-12-05 18:39:38,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:38,446 INFO L130 PetriNetUnfolder]: 488/1329 cut-off events. [2022-12-05 18:39:38,446 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-05 18:39:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1329 events. 488/1329 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9162 event pairs, 90 based on Foata normal form. 0/1286 useless extension candidates. Maximal degree in co-relation 2174. Up to 403 conditions per place. [2022-12-05 18:39:38,455 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 19 selfloop transitions, 2 changer transitions 46/141 dead transitions. [2022-12-05 18:39:38,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 141 transitions, 422 flow [2022-12-05 18:39:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:39:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:39:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2022-12-05 18:39:38,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8580246913580247 [2022-12-05 18:39:38,459 INFO L175 Difference]: Start difference. First operand has 110 places, 101 transitions, 212 flow. Second operand 9 states and 834 transitions. [2022-12-05 18:39:38,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 141 transitions, 422 flow [2022-12-05 18:39:38,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:39:38,463 INFO L231 Difference]: Finished difference. Result has 123 places, 91 transitions, 208 flow [2022-12-05 18:39:38,463 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=123, PETRI_TRANSITIONS=91} [2022-12-05 18:39:38,464 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 10 predicate places. [2022-12-05 18:39:38,464 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 91 transitions, 208 flow [2022-12-05 18:39:38,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 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 18:39:38,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:38,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:38,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:39:38,466 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 18:39:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1569063242, now seen corresponding path program 1 times [2022-12-05 18:39:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:38,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268097563] [2022-12-05 18:39:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:39,198 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 18:39:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:39,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268097563] [2022-12-05 18:39:39,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268097563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:39,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:39,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019698885] [2022-12-05 18:39:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:39,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:39,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2022-12-05 18:39:39,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 91 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 18:39:39,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:39,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2022-12-05 18:39:39,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:39,614 INFO L130 PetriNetUnfolder]: 723/1349 cut-off events. [2022-12-05 18:39:39,614 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-05 18:39:39,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 1349 events. 723/1349 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7160 event pairs, 117 based on Foata normal form. 36/1339 useless extension candidates. Maximal degree in co-relation 2841. Up to 640 conditions per place. [2022-12-05 18:39:39,620 INFO L137 encePairwiseOnDemand]: 102/108 looper letters, 33 selfloop transitions, 2 changer transitions 40/138 dead transitions. [2022-12-05 18:39:39,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 138 transitions, 475 flow [2022-12-05 18:39:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:39:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:39:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2022-12-05 18:39:39,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7736625514403292 [2022-12-05 18:39:39,622 INFO L175 Difference]: Start difference. First operand has 123 places, 91 transitions, 208 flow. Second operand 9 states and 752 transitions. [2022-12-05 18:39:39,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 138 transitions, 475 flow [2022-12-05 18:39:39,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 138 transitions, 441 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-05 18:39:39,635 INFO L231 Difference]: Finished difference. Result has 114 places, 91 transitions, 212 flow [2022-12-05 18:39:39,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=114, PETRI_TRANSITIONS=91} [2022-12-05 18:39:39,636 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 1 predicate places. [2022-12-05 18:39:39,636 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 91 transitions, 212 flow [2022-12-05 18:39:39,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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 18:39:39,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:39,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:39,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:39:39,637 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 18:39:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 828286829, now seen corresponding path program 1 times [2022-12-05 18:39:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:39,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578279682] [2022-12-05 18:39:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:40,137 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 18:39:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578279682] [2022-12-05 18:39:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578279682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:40,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:40,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653896030] [2022-12-05 18:39:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:40,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:40,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:40,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:40,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2022-12-05 18:39:40,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 91 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 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 18:39:40,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:40,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2022-12-05 18:39:40,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:41,053 INFO L130 PetriNetUnfolder]: 1171/2362 cut-off events. [2022-12-05 18:39:41,054 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2022-12-05 18:39:41,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 2362 events. 1171/2362 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15019 event pairs, 155 based on Foata normal form. 52/2325 useless extension candidates. Maximal degree in co-relation 4772. Up to 566 conditions per place. [2022-12-05 18:39:41,063 INFO L137 encePairwiseOnDemand]: 92/108 looper letters, 43 selfloop transitions, 18 changer transitions 80/202 dead transitions. [2022-12-05 18:39:41,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 202 transitions, 786 flow [2022-12-05 18:39:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 18:39:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 18:39:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1386 transitions. [2022-12-05 18:39:41,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2022-12-05 18:39:41,066 INFO L175 Difference]: Start difference. First operand has 114 places, 91 transitions, 212 flow. Second operand 17 states and 1386 transitions. [2022-12-05 18:39:41,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 202 transitions, 786 flow [2022-12-05 18:39:41,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 202 transitions, 724 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-12-05 18:39:41,073 INFO L231 Difference]: Finished difference. Result has 131 places, 105 transitions, 393 flow [2022-12-05 18:39:41,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=393, PETRI_PLACES=131, PETRI_TRANSITIONS=105} [2022-12-05 18:39:41,074 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 18 predicate places. [2022-12-05 18:39:41,074 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 105 transitions, 393 flow [2022-12-05 18:39:41,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.28571428571429) internal successors, (534), 7 states have internal predecessors, (534), 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 18:39:41,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:41,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:41,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:39:41,075 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 18:39:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1407805719, now seen corresponding path program 2 times [2022-12-05 18:39:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:41,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894008402] [2022-12-05 18:39:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:41,868 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 18:39:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:41,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894008402] [2022-12-05 18:39:41,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894008402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:41,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:41,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:39:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130746659] [2022-12-05 18:39:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:41,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:39:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:39:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:39:41,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2022-12-05 18:39:41,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 105 transitions, 393 flow. Second operand has 10 states, 10 states have (on average 77.2) internal successors, (772), 10 states have internal predecessors, (772), 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 18:39:41,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:41,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2022-12-05 18:39:41,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:42,727 INFO L130 PetriNetUnfolder]: 975/1858 cut-off events. [2022-12-05 18:39:42,727 INFO L131 PetriNetUnfolder]: For 12820/17650 co-relation queries the response was YES. [2022-12-05 18:39:42,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9462 conditions, 1858 events. 975/1858 cut-off events. For 12820/17650 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10629 event pairs, 101 based on Foata normal form. 61/1844 useless extension candidates. Maximal degree in co-relation 9383. Up to 993 conditions per place. [2022-12-05 18:39:42,740 INFO L137 encePairwiseOnDemand]: 90/108 looper letters, 50 selfloop transitions, 37 changer transitions 68/219 dead transitions. [2022-12-05 18:39:42,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 219 transitions, 1880 flow [2022-12-05 18:39:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 18:39:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 18:39:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1626 transitions. [2022-12-05 18:39:42,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7527777777777778 [2022-12-05 18:39:42,744 INFO L175 Difference]: Start difference. First operand has 131 places, 105 transitions, 393 flow. Second operand 20 states and 1626 transitions. [2022-12-05 18:39:42,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 219 transitions, 1880 flow [2022-12-05 18:39:42,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 219 transitions, 1823 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-12-05 18:39:42,757 INFO L231 Difference]: Finished difference. Result has 146 places, 135 transitions, 847 flow [2022-12-05 18:39:42,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=847, PETRI_PLACES=146, PETRI_TRANSITIONS=135} [2022-12-05 18:39:42,758 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 33 predicate places. [2022-12-05 18:39:42,758 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 847 flow [2022-12-05 18:39:42,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.2) internal successors, (772), 10 states have internal predecessors, (772), 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 18:39:42,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:42,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:42,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:39:42,759 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 18:39:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1837230508, now seen corresponding path program 1 times [2022-12-05 18:39:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:42,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84740571] [2022-12-05 18:39:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:42,908 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 18:39:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:42,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84740571] [2022-12-05 18:39:42,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84740571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:42,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:42,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807656546] [2022-12-05 18:39:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:42,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2022-12-05 18:39:42,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 847 flow. Second operand has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 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 18:39:42,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:42,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2022-12-05 18:39:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:43,356 INFO L130 PetriNetUnfolder]: 906/1742 cut-off events. [2022-12-05 18:39:43,356 INFO L131 PetriNetUnfolder]: For 39116/64055 co-relation queries the response was YES. [2022-12-05 18:39:43,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13188 conditions, 1742 events. 906/1742 cut-off events. For 39116/64055 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9709 event pairs, 95 based on Foata normal form. 45/1687 useless extension candidates. Maximal degree in co-relation 13100. Up to 842 conditions per place. [2022-12-05 18:39:43,372 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 43 selfloop transitions, 4 changer transitions 76/195 dead transitions. [2022-12-05 18:39:43,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 195 transitions, 2270 flow [2022-12-05 18:39:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 902 transitions. [2022-12-05 18:39:43,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8351851851851851 [2022-12-05 18:39:43,374 INFO L175 Difference]: Start difference. First operand has 146 places, 135 transitions, 847 flow. Second operand 10 states and 902 transitions. [2022-12-05 18:39:43,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 195 transitions, 2270 flow [2022-12-05 18:39:43,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 195 transitions, 1782 flow, removed 241 selfloop flow, removed 15 redundant places. [2022-12-05 18:39:43,405 INFO L231 Difference]: Finished difference. Result has 136 places, 98 transitions, 437 flow [2022-12-05 18:39:43,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=437, PETRI_PLACES=136, PETRI_TRANSITIONS=98} [2022-12-05 18:39:43,408 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 23 predicate places. [2022-12-05 18:39:43,408 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 98 transitions, 437 flow [2022-12-05 18:39:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.0) internal successors, (595), 7 states have internal predecessors, (595), 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 18:39:43,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:43,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:39:43,409 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 18:39:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1472054567, now seen corresponding path program 1 times [2022-12-05 18:39:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:43,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108013711] [2022-12-05 18:39:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:43,929 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 18:39:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:43,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108013711] [2022-12-05 18:39:43,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108013711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:43,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:43,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:43,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159565747] [2022-12-05 18:39:43,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:43,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:43,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:43,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:43,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2022-12-05 18:39:43,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 98 transitions, 437 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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 18:39:43,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:43,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2022-12-05 18:39:43,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:44,208 INFO L130 PetriNetUnfolder]: 373/835 cut-off events. [2022-12-05 18:39:44,209 INFO L131 PetriNetUnfolder]: For 6101/7989 co-relation queries the response was YES. [2022-12-05 18:39:44,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 835 events. 373/835 cut-off events. For 6101/7989 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3998 event pairs, 75 based on Foata normal form. 18/822 useless extension candidates. Maximal degree in co-relation 4708. Up to 386 conditions per place. [2022-12-05 18:39:44,216 INFO L137 encePairwiseOnDemand]: 101/108 looper letters, 40 selfloop transitions, 4 changer transitions 32/139 dead transitions. [2022-12-05 18:39:44,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 139 transitions, 1107 flow [2022-12-05 18:39:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 817 transitions. [2022-12-05 18:39:44,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7564814814814815 [2022-12-05 18:39:44,218 INFO L175 Difference]: Start difference. First operand has 136 places, 98 transitions, 437 flow. Second operand 10 states and 817 transitions. [2022-12-05 18:39:44,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 139 transitions, 1107 flow [2022-12-05 18:39:44,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 139 transitions, 995 flow, removed 42 selfloop flow, removed 17 redundant places. [2022-12-05 18:39:44,229 INFO L231 Difference]: Finished difference. Result has 129 places, 98 transitions, 394 flow [2022-12-05 18:39:44,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=394, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2022-12-05 18:39:44,230 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 16 predicate places. [2022-12-05 18:39:44,230 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 394 flow [2022-12-05 18:39:44,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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 18:39:44,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:44,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:39:44,231 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 18:39:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:44,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1646750281, now seen corresponding path program 1 times [2022-12-05 18:39:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:44,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854998727] [2022-12-05 18:39:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:44,875 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 18:39:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:44,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854998727] [2022-12-05 18:39:44,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854998727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:44,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:44,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-05 18:39:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853450608] [2022-12-05 18:39:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:44,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 18:39:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 18:39:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-05 18:39:44,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2022-12-05 18:39:44,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 75.6) internal successors, (756), 10 states have internal predecessors, (756), 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 18:39:44,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:44,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2022-12-05 18:39:44,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:45,161 INFO L130 PetriNetUnfolder]: 398/893 cut-off events. [2022-12-05 18:39:45,161 INFO L131 PetriNetUnfolder]: For 7410/9036 co-relation queries the response was YES. [2022-12-05 18:39:45,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 893 events. 398/893 cut-off events. For 7410/9036 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4371 event pairs, 53 based on Foata normal form. 13/858 useless extension candidates. Maximal degree in co-relation 4941. Up to 384 conditions per place. [2022-12-05 18:39:45,168 INFO L137 encePairwiseOnDemand]: 95/108 looper letters, 41 selfloop transitions, 11 changer transitions 29/142 dead transitions. [2022-12-05 18:39:45,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 142 transitions, 1048 flow [2022-12-05 18:39:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 795 transitions. [2022-12-05 18:39:45,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2022-12-05 18:39:45,170 INFO L175 Difference]: Start difference. First operand has 129 places, 98 transitions, 394 flow. Second operand 10 states and 795 transitions. [2022-12-05 18:39:45,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 142 transitions, 1048 flow [2022-12-05 18:39:45,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 142 transitions, 1012 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-12-05 18:39:45,177 INFO L231 Difference]: Finished difference. Result has 128 places, 101 transitions, 449 flow [2022-12-05 18:39:45,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=449, PETRI_PLACES=128, PETRI_TRANSITIONS=101} [2022-12-05 18:39:45,178 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 15 predicate places. [2022-12-05 18:39:45,178 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 101 transitions, 449 flow [2022-12-05 18:39:45,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.6) internal successors, (756), 10 states have internal predecessors, (756), 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 18:39:45,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:45,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:45,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:39:45,179 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 18:39:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 840381635, now seen corresponding path program 2 times [2022-12-05 18:39:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975728326] [2022-12-05 18:39:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:45,765 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 18:39:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975728326] [2022-12-05 18:39:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975728326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:45,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:45,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:39:45,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781154414] [2022-12-05 18:39:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:45,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:39:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:39:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:39:45,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-12-05 18:39:45,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 101 transitions, 449 flow. Second operand has 11 states, 11 states have (on average 80.81818181818181) internal successors, (889), 11 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:39:45,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:45,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-12-05 18:39:45,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:46,099 INFO L130 PetriNetUnfolder]: 285/676 cut-off events. [2022-12-05 18:39:46,099 INFO L131 PetriNetUnfolder]: For 6637/8611 co-relation queries the response was YES. [2022-12-05 18:39:46,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 676 events. 285/676 cut-off events. For 6637/8611 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3035 event pairs, 34 based on Foata normal form. 27/682 useless extension candidates. Maximal degree in co-relation 3990. Up to 307 conditions per place. [2022-12-05 18:39:46,104 INFO L137 encePairwiseOnDemand]: 95/108 looper letters, 36 selfloop transitions, 14 changer transitions 22/139 dead transitions. [2022-12-05 18:39:46,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 139 transitions, 1079 flow [2022-12-05 18:39:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:39:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:39:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 934 transitions. [2022-12-05 18:39:46,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7861952861952862 [2022-12-05 18:39:46,106 INFO L175 Difference]: Start difference. First operand has 128 places, 101 transitions, 449 flow. Second operand 11 states and 934 transitions. [2022-12-05 18:39:46,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 139 transitions, 1079 flow [2022-12-05 18:39:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 139 transitions, 1038 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-12-05 18:39:46,111 INFO L231 Difference]: Finished difference. Result has 133 places, 105 transitions, 525 flow [2022-12-05 18:39:46,112 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=525, PETRI_PLACES=133, PETRI_TRANSITIONS=105} [2022-12-05 18:39:46,112 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 20 predicate places. [2022-12-05 18:39:46,112 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 105 transitions, 525 flow [2022-12-05 18:39:46,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.81818181818181) internal successors, (889), 11 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:39:46,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:46,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:46,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:39:46,113 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 18:39:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1755960281, now seen corresponding path program 3 times [2022-12-05 18:39:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705102301] [2022-12-05 18:39:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:39:46,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:46,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705102301] [2022-12-05 18:39:46,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705102301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:46,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:46,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:39:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922385494] [2022-12-05 18:39:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:46,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:39:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:39:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:39:46,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2022-12-05 18:39:46,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 105 transitions, 525 flow. Second operand has 12 states, 12 states have (on average 75.16666666666667) internal successors, (902), 12 states have internal predecessors, (902), 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 18:39:46,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:46,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2022-12-05 18:39:46,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:47,169 INFO L130 PetriNetUnfolder]: 296/708 cut-off events. [2022-12-05 18:39:47,169 INFO L131 PetriNetUnfolder]: For 7043/7379 co-relation queries the response was YES. [2022-12-05 18:39:47,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 708 events. 296/708 cut-off events. For 7043/7379 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3304 event pairs, 35 based on Foata normal form. 23/722 useless extension candidates. Maximal degree in co-relation 4254. Up to 299 conditions per place. [2022-12-05 18:39:47,175 INFO L137 encePairwiseOnDemand]: 90/108 looper letters, 35 selfloop transitions, 16 changer transitions 24/136 dead transitions. [2022-12-05 18:39:47,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 1098 flow [2022-12-05 18:39:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:39:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:39:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 946 transitions. [2022-12-05 18:39:47,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7299382716049383 [2022-12-05 18:39:47,177 INFO L175 Difference]: Start difference. First operand has 133 places, 105 transitions, 525 flow. Second operand 12 states and 946 transitions. [2022-12-05 18:39:47,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 1098 flow [2022-12-05 18:39:47,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 136 transitions, 1016 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-05 18:39:47,183 INFO L231 Difference]: Finished difference. Result has 136 places, 102 transitions, 478 flow [2022-12-05 18:39:47,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=478, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2022-12-05 18:39:47,184 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 23 predicate places. [2022-12-05 18:39:47,184 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 478 flow [2022-12-05 18:39:47,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.16666666666667) internal successors, (902), 12 states have internal predecessors, (902), 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 18:39:47,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:47,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:47,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:39:47,185 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 18:39:47,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1631093679, now seen corresponding path program 4 times [2022-12-05 18:39:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:47,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054439055] [2022-12-05 18:39:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:47,891 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 18:39:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:47,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054439055] [2022-12-05 18:39:47,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054439055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:47,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:47,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:39:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188900668] [2022-12-05 18:39:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:47,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:39:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:39:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:39:47,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2022-12-05 18:39:47,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 478 flow. Second operand has 12 states, 12 states have (on average 75.16666666666667) internal successors, (902), 12 states have internal predecessors, (902), 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 18:39:47,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:47,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2022-12-05 18:39:47,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:48,205 INFO L130 PetriNetUnfolder]: 250/625 cut-off events. [2022-12-05 18:39:48,206 INFO L131 PetriNetUnfolder]: For 6129/6342 co-relation queries the response was YES. [2022-12-05 18:39:48,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 625 events. 250/625 cut-off events. For 6129/6342 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2881 event pairs, 33 based on Foata normal form. 23/639 useless extension candidates. Maximal degree in co-relation 3724. Up to 269 conditions per place. [2022-12-05 18:39:48,210 INFO L137 encePairwiseOnDemand]: 93/108 looper letters, 36 selfloop transitions, 14 changer transitions 24/135 dead transitions. [2022-12-05 18:39:48,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 1078 flow [2022-12-05 18:39:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 18:39:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 18:39:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 943 transitions. [2022-12-05 18:39:48,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7276234567901234 [2022-12-05 18:39:48,214 INFO L175 Difference]: Start difference. First operand has 136 places, 102 transitions, 478 flow. Second operand 12 states and 943 transitions. [2022-12-05 18:39:48,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 1078 flow [2022-12-05 18:39:48,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 1022 flow, removed 12 selfloop flow, removed 11 redundant places. [2022-12-05 18:39:48,220 INFO L231 Difference]: Finished difference. Result has 138 places, 101 transitions, 480 flow [2022-12-05 18:39:48,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=480, PETRI_PLACES=138, PETRI_TRANSITIONS=101} [2022-12-05 18:39:48,220 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 25 predicate places. [2022-12-05 18:39:48,221 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 101 transitions, 480 flow [2022-12-05 18:39:48,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.16666666666667) internal successors, (902), 12 states have internal predecessors, (902), 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 18:39:48,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:48,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:48,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:39:48,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1719223192, now seen corresponding path program 1 times [2022-12-05 18:39:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:48,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993719628] [2022-12-05 18:39:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:49,124 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 18:39:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:49,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993719628] [2022-12-05 18:39:49,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993719628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:49,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:49,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:39:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031004861] [2022-12-05 18:39:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:49,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:39:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:39:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:39:49,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 108 [2022-12-05 18:39:49,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 101 transitions, 480 flow. Second operand has 12 states, 12 states have (on average 74.33333333333333) internal successors, (892), 12 states have internal predecessors, (892), 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 18:39:49,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:49,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 108 [2022-12-05 18:39:49,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:50,593 INFO L130 PetriNetUnfolder]: 245/710 cut-off events. [2022-12-05 18:39:50,593 INFO L131 PetriNetUnfolder]: For 7373/9118 co-relation queries the response was YES. [2022-12-05 18:39:50,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 710 events. 245/710 cut-off events. For 7373/9118 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3774 event pairs, 20 based on Foata normal form. 31/720 useless extension candidates. Maximal degree in co-relation 4272. Up to 310 conditions per place. [2022-12-05 18:39:50,598 INFO L137 encePairwiseOnDemand]: 93/108 looper letters, 49 selfloop transitions, 22 changer transitions 82/213 dead transitions. [2022-12-05 18:39:50,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 213 transitions, 2511 flow [2022-12-05 18:39:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-05 18:39:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-05 18:39:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2528 transitions. [2022-12-05 18:39:50,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7093153759820426 [2022-12-05 18:39:50,603 INFO L175 Difference]: Start difference. First operand has 138 places, 101 transitions, 480 flow. Second operand 33 states and 2528 transitions. [2022-12-05 18:39:50,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 213 transitions, 2511 flow [2022-12-05 18:39:50,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 213 transitions, 2040 flow, removed 212 selfloop flow, removed 15 redundant places. [2022-12-05 18:39:50,611 INFO L231 Difference]: Finished difference. Result has 179 places, 111 transitions, 693 flow [2022-12-05 18:39:50,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=693, PETRI_PLACES=179, PETRI_TRANSITIONS=111} [2022-12-05 18:39:50,612 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 66 predicate places. [2022-12-05 18:39:50,612 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 111 transitions, 693 flow [2022-12-05 18:39:50,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.33333333333333) internal successors, (892), 12 states have internal predecessors, (892), 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 18:39:50,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:50,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:50,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:39:50,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1496515533, now seen corresponding path program 1 times [2022-12-05 18:39:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:50,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458125823] [2022-12-05 18:39:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:52,088 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 18:39:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458125823] [2022-12-05 18:39:52,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458125823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:52,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:52,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:39:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062033450] [2022-12-05 18:39:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:52,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:39:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:52,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:39:52,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:39:52,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-12-05 18:39:52,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 111 transitions, 693 flow. Second operand has 12 states, 12 states have (on average 79.0) internal successors, (948), 12 states have internal predecessors, (948), 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 18:39:52,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:52,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-12-05 18:39:52,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:52,692 INFO L130 PetriNetUnfolder]: 131/494 cut-off events. [2022-12-05 18:39:52,692 INFO L131 PetriNetUnfolder]: For 6109/7667 co-relation queries the response was YES. [2022-12-05 18:39:52,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 494 events. 131/494 cut-off events. For 6109/7667 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2498 event pairs, 41 based on Foata normal form. 23/494 useless extension candidates. Maximal degree in co-relation 2955. Up to 195 conditions per place. [2022-12-05 18:39:52,697 INFO L137 encePairwiseOnDemand]: 95/108 looper letters, 53 selfloop transitions, 16 changer transitions 26/160 dead transitions. [2022-12-05 18:39:52,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 160 transitions, 1716 flow [2022-12-05 18:39:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:39:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:39:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1547 transitions. [2022-12-05 18:39:52,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7538986354775828 [2022-12-05 18:39:52,702 INFO L175 Difference]: Start difference. First operand has 179 places, 111 transitions, 693 flow. Second operand 19 states and 1547 transitions. [2022-12-05 18:39:52,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 160 transitions, 1716 flow [2022-12-05 18:39:52,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 160 transitions, 1369 flow, removed 168 selfloop flow, removed 27 redundant places. [2022-12-05 18:39:52,715 INFO L231 Difference]: Finished difference. Result has 159 places, 110 transitions, 639 flow [2022-12-05 18:39:52,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=639, PETRI_PLACES=159, PETRI_TRANSITIONS=110} [2022-12-05 18:39:52,715 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 46 predicate places. [2022-12-05 18:39:52,715 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 110 transitions, 639 flow [2022-12-05 18:39:52,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.0) internal successors, (948), 12 states have internal predecessors, (948), 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 18:39:52,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:52,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:52,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:39:52,716 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1619386233, now seen corresponding path program 2 times [2022-12-05 18:39:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:52,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78201680] [2022-12-05 18:39:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:52,887 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 18:39:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:52,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78201680] [2022-12-05 18:39:52,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78201680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:52,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:52,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:39:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983030576] [2022-12-05 18:39:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:52,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:39:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:52,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:39:52,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:39:52,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-05 18:39:52,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 110 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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 18:39:52,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:52,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-05 18:39:52,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:53,433 INFO L130 PetriNetUnfolder]: 1739/3434 cut-off events. [2022-12-05 18:39:53,433 INFO L131 PetriNetUnfolder]: For 36117/36149 co-relation queries the response was YES. [2022-12-05 18:39:53,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15469 conditions, 3434 events. 1739/3434 cut-off events. For 36117/36149 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23549 event pairs, 58 based on Foata normal form. 32/3391 useless extension candidates. Maximal degree in co-relation 15379. Up to 1102 conditions per place. [2022-12-05 18:39:53,447 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 57 selfloop transitions, 6 changer transitions 89/223 dead transitions. [2022-12-05 18:39:53,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 223 transitions, 2497 flow [2022-12-05 18:39:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 913 transitions. [2022-12-05 18:39:53,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8453703703703703 [2022-12-05 18:39:53,449 INFO L175 Difference]: Start difference. First operand has 159 places, 110 transitions, 639 flow. Second operand 10 states and 913 transitions. [2022-12-05 18:39:53,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 223 transitions, 2497 flow [2022-12-05 18:39:53,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 223 transitions, 2333 flow, removed 10 selfloop flow, removed 22 redundant places. [2022-12-05 18:39:53,462 INFO L231 Difference]: Finished difference. Result has 143 places, 105 transitions, 560 flow [2022-12-05 18:39:53,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=560, PETRI_PLACES=143, PETRI_TRANSITIONS=105} [2022-12-05 18:39:53,462 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 30 predicate places. [2022-12-05 18:39:53,462 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 105 transitions, 560 flow [2022-12-05 18:39:53,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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 18:39:53,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:53,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:53,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:39:53,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -882111707, now seen corresponding path program 1 times [2022-12-05 18:39:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:53,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070856849] [2022-12-05 18:39:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:53,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:53,611 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 18:39:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070856849] [2022-12-05 18:39:53,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070856849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:53,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:53,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:39:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203996330] [2022-12-05 18:39:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:39:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:39:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:39:53,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-05 18:39:53,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 105 transitions, 560 flow. Second operand has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 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 18:39:53,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:53,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-05 18:39:53,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:53,986 INFO L130 PetriNetUnfolder]: 620/1547 cut-off events. [2022-12-05 18:39:53,986 INFO L131 PetriNetUnfolder]: For 13951/13961 co-relation queries the response was YES. [2022-12-05 18:39:53,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7598 conditions, 1547 events. 620/1547 cut-off events. For 13951/13961 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10165 event pairs, 16 based on Foata normal form. 75/1618 useless extension candidates. Maximal degree in co-relation 7516. Up to 446 conditions per place. [2022-12-05 18:39:53,996 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 61 selfloop transitions, 9 changer transitions 59/199 dead transitions. [2022-12-05 18:39:53,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 199 transitions, 2136 flow [2022-12-05 18:39:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:39:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:39:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 909 transitions. [2022-12-05 18:39:53,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2022-12-05 18:39:53,998 INFO L175 Difference]: Start difference. First operand has 143 places, 105 transitions, 560 flow. Second operand 10 states and 909 transitions. [2022-12-05 18:39:53,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 199 transitions, 2136 flow [2022-12-05 18:39:54,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 199 transitions, 2071 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-12-05 18:39:54,009 INFO L231 Difference]: Finished difference. Result has 145 places, 106 transitions, 593 flow [2022-12-05 18:39:54,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=593, PETRI_PLACES=145, PETRI_TRANSITIONS=106} [2022-12-05 18:39:54,010 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 32 predicate places. [2022-12-05 18:39:54,010 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 106 transitions, 593 flow [2022-12-05 18:39:54,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 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 18:39:54,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:54,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:54,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 18:39:54,011 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1109453714, now seen corresponding path program 1 times [2022-12-05 18:39:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:54,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880073890] [2022-12-05 18:39:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:54,987 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 18:39:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:54,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880073890] [2022-12-05 18:39:54,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880073890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:54,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:54,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:39:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264889347] [2022-12-05 18:39:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:54,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:39:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:39:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:39:54,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2022-12-05 18:39:54,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 106 transitions, 593 flow. Second operand has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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 18:39:54,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:54,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2022-12-05 18:39:54,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:55,404 INFO L130 PetriNetUnfolder]: 124/643 cut-off events. [2022-12-05 18:39:55,404 INFO L131 PetriNetUnfolder]: For 3089/3229 co-relation queries the response was YES. [2022-12-05 18:39:55,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 643 events. 124/643 cut-off events. For 3089/3229 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3903 event pairs, 32 based on Foata normal form. 20/647 useless extension candidates. Maximal degree in co-relation 2705. Up to 144 conditions per place. [2022-12-05 18:39:55,409 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 33 selfloop transitions, 9 changer transitions 18/129 dead transitions. [2022-12-05 18:39:55,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 129 transitions, 1001 flow [2022-12-05 18:39:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:39:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:39:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1117 transitions. [2022-12-05 18:39:55,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7387566137566137 [2022-12-05 18:39:55,411 INFO L175 Difference]: Start difference. First operand has 145 places, 106 transitions, 593 flow. Second operand 14 states and 1117 transitions. [2022-12-05 18:39:55,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 129 transitions, 1001 flow [2022-12-05 18:39:55,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 129 transitions, 945 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-12-05 18:39:55,419 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 563 flow [2022-12-05 18:39:55,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=563, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2022-12-05 18:39:55,419 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 40 predicate places. [2022-12-05 18:39:55,419 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 563 flow [2022-12-05 18:39:55,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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 18:39:55,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:55,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:55,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 18:39:55,420 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 173610962, now seen corresponding path program 2 times [2022-12-05 18:39:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794598886] [2022-12-05 18:39:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:56,094 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 18:39:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794598886] [2022-12-05 18:39:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794598886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:56,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-05 18:39:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568129720] [2022-12-05 18:39:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:56,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 18:39:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 18:39:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-05 18:39:56,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2022-12-05 18:39:56,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 563 flow. Second operand has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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 18:39:56,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:56,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2022-12-05 18:39:56,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:56,404 INFO L130 PetriNetUnfolder]: 114/572 cut-off events. [2022-12-05 18:39:56,404 INFO L131 PetriNetUnfolder]: For 2247/2345 co-relation queries the response was YES. [2022-12-05 18:39:56,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 572 events. 114/572 cut-off events. For 2247/2345 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3327 event pairs, 18 based on Foata normal form. 16/576 useless extension candidates. Maximal degree in co-relation 2149. Up to 114 conditions per place. [2022-12-05 18:39:56,408 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 37 selfloop transitions, 8 changer transitions 13/127 dead transitions. [2022-12-05 18:39:56,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 127 transitions, 985 flow [2022-12-05 18:39:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:39:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:39:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 889 transitions. [2022-12-05 18:39:56,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7483164983164983 [2022-12-05 18:39:56,410 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 563 flow. Second operand 11 states and 889 transitions. [2022-12-05 18:39:56,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 127 transitions, 985 flow [2022-12-05 18:39:56,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 889 flow, removed 34 selfloop flow, removed 17 redundant places. [2022-12-05 18:39:56,416 INFO L231 Difference]: Finished difference. Result has 142 places, 102 transitions, 496 flow [2022-12-05 18:39:56,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=496, PETRI_PLACES=142, PETRI_TRANSITIONS=102} [2022-12-05 18:39:56,417 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 29 predicate places. [2022-12-05 18:39:56,417 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 102 transitions, 496 flow [2022-12-05 18:39:56,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 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 18:39:56,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:56,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:56,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 18:39:56,418 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:56,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1160138542, now seen corresponding path program 3 times [2022-12-05 18:39:56,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:56,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214232331] [2022-12-05 18:39:56,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:39:56,608 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 18:39:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:39:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214232331] [2022-12-05 18:39:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214232331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:39:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:39:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:39:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690929430] [2022-12-05 18:39:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:39:56,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:39:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:39:56,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:39:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:39:56,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 108 [2022-12-05 18:39:56,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 102 transitions, 496 flow. Second operand has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 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 18:39:56,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:39:56,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 108 [2022-12-05 18:39:56,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:39:56,824 INFO L130 PetriNetUnfolder]: 131/498 cut-off events. [2022-12-05 18:39:56,824 INFO L131 PetriNetUnfolder]: For 2757/2757 co-relation queries the response was YES. [2022-12-05 18:39:56,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 498 events. 131/498 cut-off events. For 2757/2757 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2605 event pairs, 10 based on Foata normal form. 20/516 useless extension candidates. Maximal degree in co-relation 1990. Up to 103 conditions per place. [2022-12-05 18:39:56,827 INFO L137 encePairwiseOnDemand]: 99/108 looper letters, 38 selfloop transitions, 12 changer transitions 25/144 dead transitions. [2022-12-05 18:39:56,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 1205 flow [2022-12-05 18:39:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 18:39:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 18:39:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 962 transitions. [2022-12-05 18:39:56,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8097643097643098 [2022-12-05 18:39:56,829 INFO L175 Difference]: Start difference. First operand has 142 places, 102 transitions, 496 flow. Second operand 11 states and 962 transitions. [2022-12-05 18:39:56,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 1205 flow [2022-12-05 18:39:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 1035 flow, removed 41 selfloop flow, removed 18 redundant places. [2022-12-05 18:39:56,833 INFO L231 Difference]: Finished difference. Result has 136 places, 102 transitions, 451 flow [2022-12-05 18:39:56,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=451, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2022-12-05 18:39:56,833 INFO L294 CegarLoopForPetriNet]: 113 programPoint places, 23 predicate places. [2022-12-05 18:39:56,833 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 451 flow [2022-12-05 18:39:56,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.375) internal successors, (675), 8 states have internal predecessors, (675), 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 18:39:56,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:39:56,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 18:39:56,834 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 18:39:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:39:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash 219431249, now seen corresponding path program 1 times [2022-12-05 18:39:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:39:56,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438573224] [2022-12-05 18:39:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:39:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:39:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:39:56,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:39:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:39:56,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:39:56,925 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:39:56,926 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 18:39:56,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 18:39:56,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 18:39:56,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 18:39:56,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 18:39:56,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 18:39:56,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 18:39:56,928 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:39:56,932 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:39:56,932 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:39:57,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:39:57 BasicIcfg [2022-12-05 18:39:57,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:39:57,031 INFO L158 Benchmark]: Toolchain (without parser) took 21650.74ms. Allocated memory was 210.8MB in the beginning and 556.8MB in the end (delta: 346.0MB). Free memory was 167.3MB in the beginning and 358.0MB in the end (delta: -190.7MB). Peak memory consumption was 156.4MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 210.8MB. Free memory is still 186.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.97ms. Allocated memory is still 210.8MB. Free memory was 166.8MB in the beginning and 138.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.08ms. Allocated memory is still 210.8MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: Boogie Preprocessor took 48.86ms. Allocated memory is still 210.8MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: RCFGBuilder took 742.06ms. Allocated memory is still 210.8MB. Free memory was 133.2MB in the beginning and 84.5MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,031 INFO L158 Benchmark]: TraceAbstraction took 20343.69ms. Allocated memory was 210.8MB in the beginning and 556.8MB in the end (delta: 346.0MB). Free memory was 84.0MB in the beginning and 358.0MB in the end (delta: -274.1MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2022-12-05 18:39:57,032 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.14ms. Allocated memory is still 210.8MB. Free memory is still 186.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 452.97ms. Allocated memory is still 210.8MB. Free memory was 166.8MB in the beginning and 138.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.08ms. Allocated memory is still 210.8MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.86ms. Allocated memory is still 210.8MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 742.06ms. Allocated memory is still 210.8MB. Free memory was 133.2MB in the beginning and 84.5MB in the end (delta: 48.8MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 20343.69ms. Allocated memory was 210.8MB in the beginning and 556.8MB in the end (delta: 346.0MB). Free memory was 84.0MB in the beginning and 358.0MB in the end (delta: -274.1MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1849; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1851; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=57, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=57, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=57, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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, 135 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: 20.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1475 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1475 mSDsluCounter, 1289 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1033 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3035 IncrementalHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 256 mSDtfsCounter, 3035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=847occurred in iteration=5, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 8793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 18:39:57,054 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...