/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:18:37,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:18:37,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:18:37,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:18:37,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:18:37,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:18:37,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:18:37,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:18:37,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:18:37,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:18:37,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:18:37,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:18:37,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:18:37,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:18:37,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:18:37,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:18:37,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:18:37,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:18:37,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:18:37,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:18:37,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:18:37,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:18:37,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:18:37,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:18:37,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:18:37,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:18:37,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:18:37,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:18:37,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:18:37,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:18:37,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:18:37,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:18:37,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:18:37,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:18:37,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:18:37,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:18:37,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:18:37,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:18:37,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:18:37,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:18:37,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:18:37,132 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-RepeatedSemanticLbe.epf [2022-12-05 23:18:37,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:18:37,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:18:37,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:18:37,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:18:37,164 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:18:37,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:18:37,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:18:37,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:18:37,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:18:37,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:18:37,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:18:37,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:18:37,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:18:37,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:18:37,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:18:37,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:18:37,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:18:37,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:18:37,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:18:37,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:18:37,167 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 23:18:37,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:18:37,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:18:37,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:18:37,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:18:37,429 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:18:37,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:38,382 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:18:38,547 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:18:38,548 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:38,556 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cdb89ae/ed139cf3f1d746d2a9503a7508965e6e/FLAG6950afec6 [2022-12-05 23:18:38,566 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cdb89ae/ed139cf3f1d746d2a9503a7508965e6e [2022-12-05 23:18:38,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:18:38,568 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:18:38,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:18:38,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:18:38,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:18:38,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:38,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c4dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38, skipping insertion in model container [2022-12-05 23:18:38,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:38,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:18:38,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:18:38,710 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 23:18:38,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:18:38,894 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:18:38,904 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/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-05 23:18:38,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:18:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:18:38,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:18:38,986 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:18:38,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38 WrapperNode [2022-12-05 23:18:38,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:18:38,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:18:38,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:18:38,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:18:38,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,039 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-05 23:18:39,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:18:39,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:18:39,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:18:39,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:18:39,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,065 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:18:39,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:18:39,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:18:39,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:18:39,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (1/1) ... [2022-12-05 23:18:39,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:18:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:18:39,109 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 23:18:39,143 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 23:18:39,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:18:39,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:18:39,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:18:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:18:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:18:39,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:18:39,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:18:39,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:18:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:18:39,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:18:39,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:18:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:18:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:18:39,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:18:39,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:18:39,152 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 23:18:39,271 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:18:39,272 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:18:39,531 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:18:39,653 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:18:39,654 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:18:39,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:18:39 BoogieIcfgContainer [2022-12-05 23:18:39,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:18:39,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:18:39,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:18:39,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:18:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:18:38" (1/3) ... [2022-12-05 23:18:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a4243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:18:39, skipping insertion in model container [2022-12-05 23:18:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:18:38" (2/3) ... [2022-12-05 23:18:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a4243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:18:39, skipping insertion in model container [2022-12-05 23:18:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:18:39" (3/3) ... [2022-12-05 23:18:39,662 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:18:39,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:18:39,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:18:39,674 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:18:39,720 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:18:39,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:18:39,798 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:18:39,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:39,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:18:39,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:18:39,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 23:18:39,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:39,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:18:39,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 23:18:39,865 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:18:39,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:39,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:18:39,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:18:39,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-05 23:18:43,555 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-05 23:18:43,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:18:43,570 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=REPEATED_LIPTON_PN, 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;@2f24ec49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:18:43,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:18:43,572 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 23:18:43,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:43,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:43,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:18:43,573 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 23:18:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 463706, now seen corresponding path program 1 times [2022-12-05 23:18:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:43,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470409382] [2022-12-05 23:18:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:43,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:43,825 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 23:18:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470409382] [2022-12-05 23:18:43,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470409382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:43,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:43,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:18:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365535937] [2022-12-05 23:18:43,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:43,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:18:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:18:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:18:43,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 23:18:43,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:18:43,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:43,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 23:18:43,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:44,050 INFO L130 PetriNetUnfolder]: 1106/1782 cut-off events. [2022-12-05 23:18:44,051 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 23:18:44,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 1782 events. 1106/1782 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9096 event pairs, 176 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 3465. Up to 1336 conditions per place. [2022-12-05 23:18:44,059 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 31 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-05 23:18:44,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 181 flow [2022-12-05 23:18:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:44,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 23:18:44,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-05 23:18:44,068 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-05 23:18:44,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 181 flow [2022-12-05 23:18:44,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:18:44,071 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 50 flow [2022-12-05 23:18:44,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-05 23:18:44,074 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:18:44,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:44,075 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 50 flow [2022-12-05 23:18:44,076 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:44,077 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:44,077 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 50 flow [2022-12-05 23:18:44,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-05 23:18:44,081 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:18:44,081 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:44,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:18:44,081 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-05 23:18:44,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-05 23:18:44,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:44,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-05 23:18:44,157 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:18:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:18:44,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:44,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:44,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:18:44,158 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 23:18:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1461957476, now seen corresponding path program 1 times [2022-12-05 23:18:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:44,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743435184] [2022-12-05 23:18:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:44,313 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 23:18:44,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743435184] [2022-12-05 23:18:44,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743435184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:44,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:44,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:18:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192872915] [2022-12-05 23:18:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:18:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:18:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:18:44,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:44,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:44,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:44,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:44,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:44,416 INFO L130 PetriNetUnfolder]: 671/1017 cut-off events. [2022-12-05 23:18:44,416 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-05 23:18:44,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 1017 events. 671/1017 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4065 event pairs, 159 based on Foata normal form. 16/1032 useless extension candidates. Maximal degree in co-relation 2155. Up to 817 conditions per place. [2022-12-05 23:18:44,420 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-05 23:18:44,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 122 flow [2022-12-05 23:18:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:18:44,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 23:18:44,421 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:18:44,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 122 flow [2022-12-05 23:18:44,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:18:44,422 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,422 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-05 23:18:44,423 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-12-05 23:18:44,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:44,423 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,423 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:44,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:44,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,426 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:18:44,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:18:44,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:18:44,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-05 23:18:44,451 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:44,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:18:44,452 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-05 23:18:44,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:44,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:44,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:44,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:18:44,453 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 23:18:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1923959650, now seen corresponding path program 1 times [2022-12-05 23:18:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:44,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723545425] [2022-12-05 23:18:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:44,545 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 23:18:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723545425] [2022-12-05 23:18:44,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723545425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:44,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:44,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:18:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694361002] [2022-12-05 23:18:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:44,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:44,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:18:44,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:44,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:44,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:18:44,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:44,752 INFO L130 PetriNetUnfolder]: 1219/1867 cut-off events. [2022-12-05 23:18:44,752 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-12-05 23:18:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1867 events. 1219/1867 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8926 event pairs, 80 based on Foata normal form. 56/1923 useless extension candidates. Maximal degree in co-relation 4044. Up to 1183 conditions per place. [2022-12-05 23:18:44,759 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 39 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2022-12-05 23:18:44,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 210 flow [2022-12-05 23:18:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:18:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:18:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:18:44,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 23:18:44,760 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:18:44,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 210 flow [2022-12-05 23:18:44,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:18:44,761 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-05 23:18:44,762 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:18:44,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:44,762 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,762 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:44,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:44,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,769 INFO L130 PetriNetUnfolder]: 10/73 cut-off events. [2022-12-05 23:18:44,769 INFO L131 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2022-12-05 23:18:44,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 73 events. 10/73 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 5 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 135. Up to 23 conditions per place. [2022-12-05 23:18:44,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-05 23:18:44,779 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:44,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:18:44,780 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 93 flow [2022-12-05 23:18:44,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:44,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:44,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:44,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:18:44,780 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 23:18:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash -481403114, now seen corresponding path program 1 times [2022-12-05 23:18:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:44,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315746530] [2022-12-05 23:18:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:44,862 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 23:18:44,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:44,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315746530] [2022-12-05 23:18:44,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315746530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:44,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:44,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:18:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710968744] [2022-12-05 23:18:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:44,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:18:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:18:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:18:44,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:18:44,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 93 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:44,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:44,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:18:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:45,221 INFO L130 PetriNetUnfolder]: 1801/2764 cut-off events. [2022-12-05 23:18:45,221 INFO L131 PetriNetUnfolder]: For 1166/1166 co-relation queries the response was YES. [2022-12-05 23:18:45,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6680 conditions, 2764 events. 1801/2764 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14129 event pairs, 310 based on Foata normal form. 69/2833 useless extension candidates. Maximal degree in co-relation 6667. Up to 1374 conditions per place. [2022-12-05 23:18:45,229 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 41 selfloop transitions, 7 changer transitions 9/57 dead transitions. [2022-12-05 23:18:45,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 290 flow [2022-12-05 23:18:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:18:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:18:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-05 23:18:45,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:18:45,231 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 93 flow. Second operand 5 states and 55 transitions. [2022-12-05 23:18:45,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 290 flow [2022-12-05 23:18:45,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:18:45,233 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 23:18:45,234 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 23:18:45,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:45,234 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,234 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:45,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:45,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,241 INFO L130 PetriNetUnfolder]: 7/64 cut-off events. [2022-12-05 23:18:45,241 INFO L131 PetriNetUnfolder]: For 61/67 co-relation queries the response was YES. [2022-12-05 23:18:45,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 64 events. 7/64 cut-off events. For 61/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 242 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 143. Up to 20 conditions per place. [2022-12-05 23:18:45,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-05 23:18:45,244 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:45,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:18:45,245 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 125 flow [2022-12-05 23:18:45,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:18:45,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:45,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:45,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:18:45,246 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 23:18:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -486868724, now seen corresponding path program 2 times [2022-12-05 23:18:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:45,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527534060] [2022-12-05 23:18:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:45,320 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 23:18:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527534060] [2022-12-05 23:18:45,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527534060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:45,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:45,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:18:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142195630] [2022-12-05 23:18:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:45,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:18:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:18:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:18:45,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:45,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:18:45,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:45,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:45,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:45,457 INFO L130 PetriNetUnfolder]: 560/951 cut-off events. [2022-12-05 23:18:45,458 INFO L131 PetriNetUnfolder]: For 837/848 co-relation queries the response was YES. [2022-12-05 23:18:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 951 events. 560/951 cut-off events. For 837/848 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4305 event pairs, 135 based on Foata normal form. 50/997 useless extension candidates. Maximal degree in co-relation 2562. Up to 768 conditions per place. [2022-12-05 23:18:45,461 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 36 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2022-12-05 23:18:45,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 271 flow [2022-12-05 23:18:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:18:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:18:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 23:18:45,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-05 23:18:45,463 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 125 flow. Second operand 3 states and 37 transitions. [2022-12-05 23:18:45,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 271 flow [2022-12-05 23:18:45,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 255 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:18:45,465 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-05 23:18:45,466 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 23:18:45,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:45,466 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,467 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:45,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:45,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,479 INFO L130 PetriNetUnfolder]: 53/174 cut-off events. [2022-12-05 23:18:45,479 INFO L131 PetriNetUnfolder]: For 51/62 co-relation queries the response was YES. [2022-12-05 23:18:45,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 174 events. 53/174 cut-off events. For 51/62 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 898 event pairs, 26 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 364. Up to 89 conditions per place. [2022-12-05 23:18:45,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-05 23:18:45,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:45,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:18:45,483 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 137 flow [2022-12-05 23:18:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23:18:45,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:45,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:18:45,483 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 23:18:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1617577646, now seen corresponding path program 1 times [2022-12-05 23:18:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:45,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305295991] [2022-12-05 23:18:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:45,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 23:18:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305295991] [2022-12-05 23:18:45,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305295991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:45,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:45,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:18:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455660035] [2022-12-05 23:18:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:45,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:18:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:18:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:18:45,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:45,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23:18:45,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:45,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:45,696 INFO L130 PetriNetUnfolder]: 280/521 cut-off events. [2022-12-05 23:18:45,696 INFO L131 PetriNetUnfolder]: For 337/344 co-relation queries the response was YES. [2022-12-05 23:18:45,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 521 events. 280/521 cut-off events. For 337/344 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2193 event pairs, 80 based on Foata normal form. 53/570 useless extension candidates. Maximal degree in co-relation 1571. Up to 178 conditions per place. [2022-12-05 23:18:45,698 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 47 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2022-12-05 23:18:45,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 362 flow [2022-12-05 23:18:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:18:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:18:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:18:45,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-05 23:18:45,699 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 137 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:18:45,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 362 flow [2022-12-05 23:18:45,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:18:45,701 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-05 23:18:45,701 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-05 23:18:45,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:45,702 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,702 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:45,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:45,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,711 INFO L130 PetriNetUnfolder]: 24/105 cut-off events. [2022-12-05 23:18:45,711 INFO L131 PetriNetUnfolder]: For 70/93 co-relation queries the response was YES. [2022-12-05 23:18:45,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 105 events. 24/105 cut-off events. For 70/93 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 432 event pairs, 4 based on Foata normal form. 7/109 useless extension candidates. Maximal degree in co-relation 282. Up to 53 conditions per place. [2022-12-05 23:18:45,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-05 23:18:45,713 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:18:45,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:18:45,713 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 173 flow [2022-12-05 23:18:45,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 23:18:45,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:45,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:45,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:18:45,714 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 23:18:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -640930641, now seen corresponding path program 1 times [2022-12-05 23:18:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:45,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191439911] [2022-12-05 23:18:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:45,892 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 23:18:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191439911] [2022-12-05 23:18:45,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191439911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:45,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:45,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:18:45,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651238633] [2022-12-05 23:18:45,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:45,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:18:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:45,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:18:45,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:18:45,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:18:45,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 23:18:45,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:45,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:18:45,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:45,980 INFO L130 PetriNetUnfolder]: 235/427 cut-off events. [2022-12-05 23:18:45,980 INFO L131 PetriNetUnfolder]: For 574/581 co-relation queries the response was YES. [2022-12-05 23:18:45,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 427 events. 235/427 cut-off events. For 574/581 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1744 event pairs, 75 based on Foata normal form. 19/442 useless extension candidates. Maximal degree in co-relation 1397. Up to 178 conditions per place. [2022-12-05 23:18:45,982 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 43 selfloop transitions, 10 changer transitions 1/57 dead transitions. [2022-12-05 23:18:45,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 386 flow [2022-12-05 23:18:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:18:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:18:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-05 23:18:45,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.51 [2022-12-05 23:18:45,983 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 173 flow. Second operand 5 states and 51 transitions. [2022-12-05 23:18:45,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 386 flow [2022-12-05 23:18:45,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 363 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 23:18:45,987 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 182 flow [2022-12-05 23:18:45,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-05 23:18:45,987 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-05 23:18:45,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:45,987 INFO L89 Accepts]: Start accepts. Operand has 44 places, 32 transitions, 182 flow [2022-12-05 23:18:45,988 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:45,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:45,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 182 flow [2022-12-05 23:18:45,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 182 flow [2022-12-05 23:18:45,996 INFO L130 PetriNetUnfolder]: 16/69 cut-off events. [2022-12-05 23:18:45,996 INFO L131 PetriNetUnfolder]: For 94/104 co-relation queries the response was YES. [2022-12-05 23:18:45,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 69 events. 16/69 cut-off events. For 94/104 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 0 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 196. Up to 27 conditions per place. [2022-12-05 23:18:45,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 182 flow [2022-12-05 23:18:45,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-05 23:18:46,425 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:18:46,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-05 23:18:46,426 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 178 flow [2022-12-05 23:18:46,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 23:18:46,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:46,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:46,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:18:46,426 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 23:18:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:46,427 INFO L85 PathProgramCache]: Analyzing trace with hash -528034392, now seen corresponding path program 1 times [2022-12-05 23:18:46,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:46,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587194957] [2022-12-05 23:18:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:18:46,963 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 23:18:46,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:18:46,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587194957] [2022-12-05 23:18:46,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587194957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:18:46,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:18:46,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:18:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699564178] [2022-12-05 23:18:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:18:46,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:18:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:18:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:18:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:18:46,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:18:46,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 23:18:46,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:18:46,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:18:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:18:47,152 INFO L130 PetriNetUnfolder]: 257/488 cut-off events. [2022-12-05 23:18:47,152 INFO L131 PetriNetUnfolder]: For 832/832 co-relation queries the response was YES. [2022-12-05 23:18:47,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 488 events. 257/488 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2220 event pairs, 20 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 1634. Up to 246 conditions per place. [2022-12-05 23:18:47,154 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 38 selfloop transitions, 4 changer transitions 26/71 dead transitions. [2022-12-05 23:18:47,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 538 flow [2022-12-05 23:18:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:18:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:18:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-05 23:18:47,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2022-12-05 23:18:47,155 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 178 flow. Second operand 6 states and 52 transitions. [2022-12-05 23:18:47,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 538 flow [2022-12-05 23:18:47,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 476 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 23:18:47,158 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 166 flow [2022-12-05 23:18:47,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-05 23:18:47,158 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-05 23:18:47,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:18:47,159 INFO L89 Accepts]: Start accepts. Operand has 45 places, 30 transitions, 166 flow [2022-12-05 23:18:47,159 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:18:47,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:18:47,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 166 flow [2022-12-05 23:18:47,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 30 transitions, 166 flow [2022-12-05 23:18:47,166 INFO L130 PetriNetUnfolder]: 17/71 cut-off events. [2022-12-05 23:18:47,166 INFO L131 PetriNetUnfolder]: For 94/102 co-relation queries the response was YES. [2022-12-05 23:18:47,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 71 events. 17/71 cut-off events. For 94/102 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 248 event pairs, 0 based on Foata normal form. 5/75 useless extension candidates. Maximal degree in co-relation 189. Up to 22 conditions per place. [2022-12-05 23:18:47,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 30 transitions, 166 flow [2022-12-05 23:18:47,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-05 23:18:47,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [335] L788-->L804: Formula: (let ((.cse9 (= 0 (mod v_~y$r_buff1_thd3~0_72 256))) (.cse5 (= (mod v_~y$r_buff0_thd3~0_76 256) 0))) (let ((.cse7 (not .cse5)) (.cse4 (and .cse9 .cse5)) (.cse8 (and .cse5 (= (mod v_~y$w_buff1_used~0_121 256) 0))) (.cse11 (= (mod v_~y$w_buff0_used~0_134 256) 0))) (let ((.cse0 (or .cse4 .cse8 .cse11)) (.cse1 (and (not .cse11) .cse7)) (.cse3 (= (mod v_~y$w_buff0_used~0_133 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_120 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_36 256) 0)))) (and (= v_~__unbuffered_p2_EBX~0_14 (ite .cse0 v_~y~0_100 (ite .cse1 v_~y$w_buff0~0_68 v_~y$w_buff1~0_51))) (= v_~y$w_buff0_used~0_133 (ite .cse2 v_~y$w_buff0_used~0_134 (ite .cse0 v_~y$w_buff0_used~0_134 (ite .cse1 0 v_~y$w_buff0_used~0_134)))) (= (ite .cse2 v_~y$r_buff0_thd3~0_76 (ite (or .cse3 .cse4 (and .cse5 .cse6)) v_~y$r_buff0_thd3~0_76 (ite (and .cse7 (not .cse3)) 0 v_~y$r_buff0_thd3~0_76))) v_~y$r_buff0_thd3~0_75) (= v_~y$w_buff1~0_51 v_~y$w_buff1~0_50) (= v_~y$w_buff0~0_68 v_~y$w_buff0~0_67) (= |v_P2Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_36) (= v_~y$w_buff1_used~0_120 (ite .cse2 v_~y$w_buff1_used~0_121 (ite (or .cse3 .cse4 .cse8) v_~y$w_buff1_used~0_121 0))) (= v_~y~0_100 v_~y$mem_tmp~0_26) (= 0 v_~y$flush_delayed~0_31) (= (ite .cse2 v_~y$r_buff1_thd3~0_72 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_75 256) 0))) (or .cse3 (and .cse9 .cse10) (and .cse10 .cse6))) v_~y$r_buff1_thd3~0_72 0)) v_~y$r_buff1_thd3~0_71) (= |v_P2Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse2 v_~y$mem_tmp~0_26 v_~__unbuffered_p2_EBX~0_14) v_~y~0_98))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_72, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_134, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y$w_buff0~0=v_~y$w_buff0~0_68, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~y~0=v_~y~0_100, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_121} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_133, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, ~y~0=v_~y~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_120} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet3, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-05 23:18:47,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] L754-->P0EXIT: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_571 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_146 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_211 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_572 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_502 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~__unbuffered_cnt~0_193 (+ v_~__unbuffered_cnt~0_194 1)) (= |v_P0Thread1of1ForFork2_#res#1.base_35| 0) (= v_~y$w_buff0_used~0_571 (ite .cse0 0 v_~y$w_buff0_used~0_572)) (= (ite .cse1 0 v_~y$r_buff0_thd1~0_211) v_~y$r_buff0_thd1~0_210) (= v_~y~0_434 (ite .cse0 v_~y$w_buff0~0_361 (ite .cse2 v_~y$w_buff1~0_289 v_~y~0_435))) (= |v_P0Thread1of1ForFork2_#res#1.offset_35| 0) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_502) v_~y$w_buff1_used~0_501) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_501 256) 0))) (and (not (= (mod v_~y$r_buff0_thd1~0_210 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_146) v_~y$r_buff1_thd1~0_145)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_146, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_572, ~y$w_buff1~0=v_~y$w_buff1~0_289, ~y$w_buff0~0=v_~y$w_buff0~0_361, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_211, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_194, ~y~0=v_~y~0_435, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_502} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_35|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_571, ~y$w_buff1~0=v_~y$w_buff1~0_289, ~y$w_buff0~0=v_~y$w_buff0~0_361, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_210, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~y~0=v_~y~0_434, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_501} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork2_#res#1.offset, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] and [448] L833-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_172 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_521 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_172 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_457 256) 0)) .cse2)) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_522 256) 0))))) (and (= v_~y$r_buff0_thd0~0_171 (ite .cse0 0 v_~y$r_buff0_thd0~0_172)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_133| (mod v_~main$tmp_guard1~0_134 256)) (= v_~y$r_buff1_thd0~0_171 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_171 256) 0)) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_456 256) 0)))) 0 v_~y$r_buff1_thd0~0_172)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_183 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_64) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_133| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_41| 0)) (= v_~y~0_390 (ite .cse3 v_~y$w_buff0~0_331 (ite .cse4 v_~y$w_buff1~0_264 v_~y~0_391))) (= (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_457) v_~y$w_buff1_used~0_456) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_118 0) (= 2 v_~__unbuffered_p2_EAX~0_88) (= 2 v_~x~0_112))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_134) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_41| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~y$w_buff0_used~0_521 (ite .cse3 0 v_~y$w_buff0_used~0_522))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_118, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_522, ~y$w_buff1~0=v_~y$w_buff1~0_264, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_172, ~y$w_buff0~0=v_~y$w_buff0~0_331, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~y~0=v_~y~0_391, ~x~0=v_~x~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_172, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_457} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_118, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_521, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_134, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_133|, ~y$w_buff1~0=v_~y$w_buff1~0_264, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, ~y$w_buff0~0=v_~y$w_buff0~0_331, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_41|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~y~0=v_~y~0_390, ~x~0=v_~x~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_171, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_456, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:18:48,214 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:18:48,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1057 [2022-12-05 23:18:48,216 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 164 flow [2022-12-05 23:18:48,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 23:18:48,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:18:48,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:48,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:18:48,217 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 23:18:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:18:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1325309060, now seen corresponding path program 1 times [2022-12-05 23:18:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:18:48,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289214420] [2022-12-05 23:18:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:18:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:18:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:18:48,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:18:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:18:48,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:18:48,326 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:18:48,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:18:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:18:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:18:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:18:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:18:48,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:18:48,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:18:48,328 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:18:48,332 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:18:48,332 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:18:48,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:18:48 BasicIcfg [2022-12-05 23:18:48,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:18:48,369 INFO L158 Benchmark]: Toolchain (without parser) took 9800.77ms. Allocated memory was 255.9MB in the beginning and 532.7MB in the end (delta: 276.8MB). Free memory was 213.4MB in the beginning and 451.9MB in the end (delta: -238.5MB). Peak memory consumption was 39.4MB. Max. memory is 8.0GB. [2022-12-05 23:18:48,369 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory was 231.8MB in the beginning and 231.6MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:18:48,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.51ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 187.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:18:48,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.01ms. Allocated memory is still 255.9MB. Free memory was 186.7MB in the beginning and 184.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:18:48,370 INFO L158 Benchmark]: Boogie Preprocessor took 44.74ms. Allocated memory is still 255.9MB. Free memory was 184.6MB in the beginning and 182.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:18:48,370 INFO L158 Benchmark]: RCFGBuilder took 570.91ms. Allocated memory is still 255.9MB. Free memory was 182.5MB in the beginning and 147.3MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-05 23:18:48,370 INFO L158 Benchmark]: TraceAbstraction took 8710.79ms. Allocated memory was 255.9MB in the beginning and 532.7MB in the end (delta: 276.8MB). Free memory was 146.8MB in the beginning and 451.9MB in the end (delta: -305.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:18:48,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory was 231.8MB in the beginning and 231.6MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.51ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 187.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.01ms. Allocated memory is still 255.9MB. Free memory was 186.7MB in the beginning and 184.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.74ms. Allocated memory is still 255.9MB. Free memory was 184.6MB in the beginning and 182.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 570.91ms. Allocated memory is still 255.9MB. Free memory was 182.5MB in the beginning and 147.3MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8710.79ms. Allocated memory was 255.9MB in the beginning and 532.7MB in the end (delta: 276.8MB). Free memory was 146.8MB in the beginning and 451.9MB in the end (delta: -305.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 111 PlacesBefore, 36 PlacesAfterwards, 103 TransitionsBefore, 27 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1587, independent: 1502, independent conditional: 1502, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1587, independent: 1502, independent conditional: 0, independent unconditional: 1502, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1587, independent: 1502, independent conditional: 0, independent unconditional: 1502, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1587, independent: 1502, independent conditional: 0, independent unconditional: 1502, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1245, independent: 1205, independent conditional: 0, independent unconditional: 1205, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1245, independent: 1170, independent conditional: 0, independent unconditional: 1170, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1587, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 1245, unknown conditional: 0, unknown unconditional: 1245] , Statistics on independence cache: Total cache size (in pairs): 1820, Positive cache size: 1780, Positive conditional cache size: 0, Positive unconditional cache size: 1780, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 20, dependent conditional: 5, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 71, dependent conditional: 15, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 62, unknown conditional: 13, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 46, Positive conditional cache size: 9, Positive unconditional cache size: 37, Negative cache size: 16, Negative conditional cache size: 4, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 55, Positive conditional cache size: 9, Positive unconditional cache size: 46, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 57, independent conditional: 12, independent unconditional: 45, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 58, Positive conditional cache size: 9, Positive unconditional cache size: 49, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 6, independent unconditional: 53, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 62, Positive conditional cache size: 9, Positive unconditional cache size: 53, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 43, independent conditional: 8, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 62, Positive conditional cache size: 9, Positive unconditional cache size: 53, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 9, independent unconditional: 36, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 62, Positive conditional cache size: 9, Positive unconditional cache size: 53, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 90, independent conditional: 18, independent unconditional: 72, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 63, Positive conditional cache size: 9, Positive unconditional cache size: 54, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 44 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 199, independent: 152, independent conditional: 150, independent unconditional: 2, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 152, independent conditional: 125, independent unconditional: 27, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 152, independent conditional: 125, independent unconditional: 27, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 199, independent: 133, independent conditional: 110, independent unconditional: 23, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 23, unknown conditional: 19, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 104, Positive conditional cache size: 24, Positive unconditional cache size: 80, Negative cache size: 28, Negative conditional cache size: 8, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-1, t2393={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] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=0, t2393={5:0}, t2394={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] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t2395, ((void *)0), P2, ((void *)0))=1, t2393={5:0}, t2394={6:0}, t2395={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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 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) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 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 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 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_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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=66, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 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) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 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 [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 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_p2_EAX=2, __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=66, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 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) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 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) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 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 [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 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 [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=1, 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: 833]: 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: 831]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 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: 8.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 524 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 2 mSDtfsCounter, 524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=7, InterpolantAutomatonStates: 33, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:18:48,393 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...