/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/safe005_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:11:33,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:11:33,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:11:33,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:11:33,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:11:33,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:11:33,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:11:33,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:11:33,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:11:33,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:11:33,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:11:33,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:11:33,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:11:33,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:11:33,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:11:33,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:11:33,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:11:33,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:11:33,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:11:33,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:11:33,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:11:33,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:11:33,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:11:33,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:11:34,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:11:34,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:11:34,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:11:34,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:11:34,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:11:34,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:11:34,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:11:34,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:11:34,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:11:34,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:11:34,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:11:34,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:11:34,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:11:34,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:11:34,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:11:34,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:11:34,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:11:34,012 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:11:34,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:11:34,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:11:34,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:11:34,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:11:34,034 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:11:34,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:11:34,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:11:34,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:11:34,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:11:34,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:11:34,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:11:34,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:11:34,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:11:34,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:11:34,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:34,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:11:34,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:11:34,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:11:34,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:11:34,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:11:34,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:11:34,038 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:11:34,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:11:34,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:11:34,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:11:34,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:11:34,303 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:11:34,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:11:35,237 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:11:35,523 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:11:35,524 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:11:35,552 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73274ab45/4db514ea8e3d43bc86ee747695a184f4/FLAG30543ccb4 [2022-12-05 23:11:35,563 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73274ab45/4db514ea8e3d43bc86ee747695a184f4 [2022-12-05 23:11:35,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:11:35,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:11:35,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:35,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:11:35,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:11:35,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:35" (1/1) ... [2022-12-05 23:11:35,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad3b3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:35, skipping insertion in model container [2022-12-05 23:11:35,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:11:35" (1/1) ... [2022-12-05 23:11:35,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:11:35,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:11:35,762 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:11:35,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:35,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:35,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:35,978 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:11:35,988 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:11:36,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:11:36,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:11:36,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:11:36,087 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:11:36,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36 WrapperNode [2022-12-05 23:11:36,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:11:36,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:36,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:11:36,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:11:36,094 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:11:36" (1/1) ... [2022-12-05 23:11:36,125 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:11:36" (1/1) ... [2022-12-05 23:11:36,160 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-05 23:11:36,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:11:36,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:11:36,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:11:36,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:11:36,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,197 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:11:36,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:11:36,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:11:36,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:11:36,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (1/1) ... [2022-12-05 23:11:36,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:11:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:11:36,244 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:11:36,261 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:11:36,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:11:36,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:11:36,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:11:36,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:11:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:11:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:11:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:11:36,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:11:36,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:11:36,295 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:11:36,413 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:11:36,415 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:11:36,688 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:11:36,767 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:11:36,768 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:11:36,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:36 BoogieIcfgContainer [2022-12-05 23:11:36,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:11:36,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:11:36,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:11:36,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:11:36,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:11:35" (1/3) ... [2022-12-05 23:11:36,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73836319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:36, skipping insertion in model container [2022-12-05 23:11:36,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:11:36" (2/3) ... [2022-12-05 23:11:36,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73836319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:11:36, skipping insertion in model container [2022-12-05 23:11:36,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:11:36" (3/3) ... [2022-12-05 23:11:36,775 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:11:36,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:11:36,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:11:36,790 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:11:36,843 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:11:36,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:11:36,923 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:11:36,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:36,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:11:36,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:11:36,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:36,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:36,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:36,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:36,988 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:11:36,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:36,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:11:36,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:11:36,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-05 23:11:40,535 INFO L203 LiptonReduction]: Total number of compositions: 83 [2022-12-05 23:11:40,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:11:40,557 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;@7b71d83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:11:40,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:11:40,560 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-05 23:11:40,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:40,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:40,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:11:40,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 437130286, now seen corresponding path program 1 times [2022-12-05 23:11:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172472797] [2022-12-05 23:11:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:40,942 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:11:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172472797] [2022-12-05 23:11:40,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172472797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:40,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:40,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379064729] [2022-12-05 23:11:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:40,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:40,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-05 23:11:40,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:40,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:40,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-05 23:11:40,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:41,253 INFO L130 PetriNetUnfolder]: 879/1432 cut-off events. [2022-12-05 23:11:41,254 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:11:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1432 events. 879/1432 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7278 event pairs, 144 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 2788. Up to 1060 conditions per place. [2022-12-05 23:11:41,267 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-05 23:11:41,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-05 23:11:41,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-05 23:11:41,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-05 23:11:41,276 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-05 23:11:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-05 23:11:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:41,293 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-05 23:11:41,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-05 23:11:41,297 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 23:11:41,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:41,298 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-05 23:11:41,299 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:41,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:41,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-05 23:11:41,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-05 23:11:41,304 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:11:41,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:11:41,304 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 22 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:11:41,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-05 23:11:41,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 23:11:41,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:41,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-05 23:11:41,374 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:11:41,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:41,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:41,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:41,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:11:41,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2121458590, now seen corresponding path program 1 times [2022-12-05 23:11:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:41,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63991907] [2022-12-05 23:11:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:41,510 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:11:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63991907] [2022-12-05 23:11:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63991907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:41,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:41,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:41,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128636930] [2022-12-05 23:11:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:41,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:41,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:41,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:41,761 INFO L130 PetriNetUnfolder]: 1346/2064 cut-off events. [2022-12-05 23:11:41,761 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-05 23:11:41,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 2064 events. 1346/2064 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9984 event pairs, 502 based on Foata normal form. 94/2158 useless extension candidates. Maximal degree in co-relation 4321. Up to 1076 conditions per place. [2022-12-05 23:11:41,769 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2022-12-05 23:11:41,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 160 flow [2022-12-05 23:11:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 23:11:41,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-05 23:11:41,770 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-05 23:11:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 160 flow [2022-12-05 23:11:41,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:41,771 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,771 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-05 23:11:41,772 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-05 23:11:41,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:41,772 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,773 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:41,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:41,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,783 INFO L130 PetriNetUnfolder]: 46/152 cut-off events. [2022-12-05 23:11:41,783 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-05 23:11:41,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 152 events. 46/152 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 773 event pairs, 16 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 293. Up to 56 conditions per place. [2022-12-05 23:11:41,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:11:41,817 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:41,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-05 23:11:41,818 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 88 flow [2022-12-05 23:11:41,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:11:41,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:41,819 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:41,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:11:41,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1340707414, now seen corresponding path program 1 times [2022-12-05 23:11:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:41,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3541399] [2022-12-05 23:11:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:41,904 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:11:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3541399] [2022-12-05 23:11:41,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3541399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:41,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:41,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:11:41,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290359879] [2022-12-05 23:11:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:41,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:41,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:41,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:11:41,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:11:41,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:41,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:11:41,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:42,078 INFO L130 PetriNetUnfolder]: 1133/1751 cut-off events. [2022-12-05 23:11:42,079 INFO L131 PetriNetUnfolder]: For 861/861 co-relation queries the response was YES. [2022-12-05 23:11:42,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 1751 events. 1133/1751 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8001 event pairs, 479 based on Foata normal form. 30/1751 useless extension candidates. Maximal degree in co-relation 4384. Up to 1106 conditions per place. [2022-12-05 23:11:42,086 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 25 selfloop transitions, 3 changer transitions 3/33 dead transitions. [2022-12-05 23:11:42,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 178 flow [2022-12-05 23:11:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:11:42,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 23:11:42,087 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 88 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:11:42,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 178 flow [2022-12-05 23:11:42,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:42,090 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-05 23:11:42,091 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-05 23:11:42,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:42,091 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,091 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:42,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:42,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,099 INFO L130 PetriNetUnfolder]: 24/96 cut-off events. [2022-12-05 23:11:42,099 INFO L131 PetriNetUnfolder]: For 9/14 co-relation queries the response was YES. [2022-12-05 23:11:42,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 96 events. 24/96 cut-off events. For 9/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 379 event pairs, 8 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 179. Up to 34 conditions per place. [2022-12-05 23:11:42,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:11:42,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:42,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-05 23:11:42,110 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 87 flow [2022-12-05 23:11:42,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:11:42,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:42,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:42,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:11:42,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1440576216, now seen corresponding path program 1 times [2022-12-05 23:11:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:42,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106587741] [2022-12-05 23:11:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:42,212 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:11:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:42,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106587741] [2022-12-05 23:11:42,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106587741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:42,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:42,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:42,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786968121] [2022-12-05 23:11:42,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:42,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:11:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:11:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:11:42,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:42,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 87 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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:11:42,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:42,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:42,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:42,488 INFO L130 PetriNetUnfolder]: 1839/2824 cut-off events. [2022-12-05 23:11:42,488 INFO L131 PetriNetUnfolder]: For 741/741 co-relation queries the response was YES. [2022-12-05 23:11:42,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 2824 events. 1839/2824 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14570 event pairs, 236 based on Foata normal form. 45/2869 useless extension candidates. Maximal degree in co-relation 6960. Up to 1455 conditions per place. [2022-12-05 23:11:42,496 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 39 selfloop transitions, 9 changer transitions 12/60 dead transitions. [2022-12-05 23:11:42,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 314 flow [2022-12-05 23:11:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:11:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:11:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 23:11:42,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-05 23:11:42,498 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 87 flow. Second operand 5 states and 57 transitions. [2022-12-05 23:11:42,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 314 flow [2022-12-05 23:11:42,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:42,501 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-05 23:11:42,502 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-05 23:11:42,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:42,502 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,502 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:42,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:42,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,509 INFO L130 PetriNetUnfolder]: 14/78 cut-off events. [2022-12-05 23:11:42,509 INFO L131 PetriNetUnfolder]: For 42/48 co-relation queries the response was YES. [2022-12-05 23:11:42,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 78 events. 14/78 cut-off events. For 42/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 308 event pairs, 2 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 178. Up to 26 conditions per place. [2022-12-05 23:11:42,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-05 23:11:42,528 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:42,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-05 23:11:42,529 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 135 flow [2022-12-05 23:11:42,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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:11:42,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:42,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:42,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:11:42,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2113205964, now seen corresponding path program 1 times [2022-12-05 23:11:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360996449] [2022-12-05 23:11:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:42,649 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:11:42,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:42,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360996449] [2022-12-05 23:11:42,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360996449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:42,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:42,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:11:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925151665] [2022-12-05 23:11:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:42,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:11:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:11:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:11:42,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:42,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 135 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:11:42,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:42,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:42,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:42,943 INFO L130 PetriNetUnfolder]: 1626/2548 cut-off events. [2022-12-05 23:11:42,943 INFO L131 PetriNetUnfolder]: For 1619/1619 co-relation queries the response was YES. [2022-12-05 23:11:42,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6587 conditions, 2548 events. 1626/2548 cut-off events. For 1619/1619 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12973 event pairs, 340 based on Foata normal form. 48/2596 useless extension candidates. Maximal degree in co-relation 6571. Up to 654 conditions per place. [2022-12-05 23:11:42,951 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 39 selfloop transitions, 8 changer transitions 29/76 dead transitions. [2022-12-05 23:11:42,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 426 flow [2022-12-05 23:11:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:11:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:11:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-05 23:11:42,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-05 23:11:42,953 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 135 flow. Second operand 7 states and 74 transitions. [2022-12-05 23:11:42,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 426 flow [2022-12-05 23:11:42,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 416 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:11:42,957 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 141 flow [2022-12-05 23:11:42,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2022-12-05 23:11:42,958 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-05 23:11:42,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:42,958 INFO L89 Accepts]: Start accepts. Operand has 46 places, 26 transitions, 141 flow [2022-12-05 23:11:42,959 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:42,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:42,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 26 transitions, 141 flow [2022-12-05 23:11:42,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 26 transitions, 141 flow [2022-12-05 23:11:42,964 INFO L130 PetriNetUnfolder]: 4/51 cut-off events. [2022-12-05 23:11:42,964 INFO L131 PetriNetUnfolder]: For 72/75 co-relation queries the response was YES. [2022-12-05 23:11:42,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 51 events. 4/51 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 124. Up to 13 conditions per place. [2022-12-05 23:11:42,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 26 transitions, 141 flow [2022-12-05 23:11:42,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-05 23:11:42,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] $Ultimate##0-->L804: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_14 v_~__unbuffered_p2_EAX~0_15)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [321] L784-->L787: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-05 23:11:43,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] $Ultimate##0-->L787: Formula: (and (= v_~y~0_96 v_~__unbuffered_p2_EAX~0_69) (= v_~y~0_95 1) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_96} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_95} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [328] L804-->L807: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-05 23:11:43,024 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:11:43,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 23:11:43,024 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 134 flow [2022-12-05 23:11:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:11:43,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:43,025 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:43,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:11:43,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1920027849, now seen corresponding path program 1 times [2022-12-05 23:11:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:43,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712144453] [2022-12-05 23:11:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:43,166 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:11:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:43,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712144453] [2022-12-05 23:11:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712144453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:43,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:43,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:11:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422953443] [2022-12-05 23:11:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:11:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:11:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:11:43,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:11:43,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:11:43,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:43,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:11:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:43,263 INFO L130 PetriNetUnfolder]: 393/681 cut-off events. [2022-12-05 23:11:43,263 INFO L131 PetriNetUnfolder]: For 1010/1010 co-relation queries the response was YES. [2022-12-05 23:11:43,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 681 events. 393/681 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2970 event pairs, 103 based on Foata normal form. 33/711 useless extension candidates. Maximal degree in co-relation 1863. Up to 575 conditions per place. [2022-12-05 23:11:43,266 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 29 selfloop transitions, 4 changer transitions 4/39 dead transitions. [2022-12-05 23:11:43,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 279 flow [2022-12-05 23:11:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:11:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:11:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 23:11:43,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-05 23:11:43,267 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 134 flow. Second operand 3 states and 37 transitions. [2022-12-05 23:11:43,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 279 flow [2022-12-05 23:11:43,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 235 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-05 23:11:43,269 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-05 23:11:43,269 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 23:11:43,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:43,270 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,270 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:43,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:43,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,280 INFO L130 PetriNetUnfolder]: 53/149 cut-off events. [2022-12-05 23:11:43,280 INFO L131 PetriNetUnfolder]: For 38/44 co-relation queries the response was YES. [2022-12-05 23:11:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 149 events. 53/149 cut-off events. For 38/44 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 710 event pairs, 19 based on Foata normal form. 3/146 useless extension candidates. Maximal degree in co-relation 312. Up to 94 conditions per place. [2022-12-05 23:11:43,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-05 23:11:43,297 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:43,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-05 23:11:43,298 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 129 flow [2022-12-05 23:11:43,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:11:43,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:43,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:43,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:11:43,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2067623376, now seen corresponding path program 1 times [2022-12-05 23:11:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:43,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446659340] [2022-12-05 23:11:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:43,400 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:11:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:43,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446659340] [2022-12-05 23:11:43,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446659340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:43,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:43,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281574454] [2022-12-05 23:11:43,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:43,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:43,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:43,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:43,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 23:11:43,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 129 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:11:43,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:43,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 23:11:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:43,499 INFO L130 PetriNetUnfolder]: 392/691 cut-off events. [2022-12-05 23:11:43,499 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-12-05 23:11:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 691 events. 392/691 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2979 event pairs, 137 based on Foata normal form. 14/705 useless extension candidates. Maximal degree in co-relation 2064. Up to 403 conditions per place. [2022-12-05 23:11:43,502 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 29 selfloop transitions, 3 changer transitions 11/43 dead transitions. [2022-12-05 23:11:43,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 267 flow [2022-12-05 23:11:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-05 23:11:43,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-05 23:11:43,503 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 129 flow. Second operand 4 states and 38 transitions. [2022-12-05 23:11:43,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 267 flow [2022-12-05 23:11:43,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:11:43,504 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 96 flow [2022-12-05 23:11:43,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2022-12-05 23:11:43,505 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-05 23:11:43,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:43,505 INFO L89 Accepts]: Start accepts. Operand has 39 places, 22 transitions, 96 flow [2022-12-05 23:11:43,506 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:43,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:43,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 96 flow [2022-12-05 23:11:43,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 96 flow [2022-12-05 23:11:43,510 INFO L130 PetriNetUnfolder]: 18/56 cut-off events. [2022-12-05 23:11:43,511 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:11:43,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 56 events. 18/56 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 160 event pairs, 9 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 117. Up to 34 conditions per place. [2022-12-05 23:11:43,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 96 flow [2022-12-05 23:11:43,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-05 23:11:43,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_~__unbuffered_p2_EBX~0_69 v_~y~0_93) (= v_~y~0_93 v_~__unbuffered_p2_EAX~0_67) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~y~0=v_~y~0_93} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~y~0=v_~y~0_93} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [414] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_45 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_45, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:11:43,646 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:11:43,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-05 23:11:43,648 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 90 flow [2022-12-05 23:11:43,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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:11:43,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:43,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:43,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:11:43,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash 216666965, now seen corresponding path program 1 times [2022-12-05 23:11:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:43,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325599004] [2022-12-05 23:11:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:43,761 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:11:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325599004] [2022-12-05 23:11:43,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325599004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:43,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:43,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:11:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332430200] [2022-12-05 23:11:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:43,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:11:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:11:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:11:43,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:11:43,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:11:43,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:43,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:11:43,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:43,807 INFO L130 PetriNetUnfolder]: 54/117 cut-off events. [2022-12-05 23:11:43,807 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-05 23:11:43,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 117 events. 54/117 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 293 event pairs, 13 based on Foata normal form. 13/130 useless extension candidates. Maximal degree in co-relation 340. Up to 58 conditions per place. [2022-12-05 23:11:43,808 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 25 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2022-12-05 23:11:43,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 199 flow [2022-12-05 23:11:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:11:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:11:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:11:43,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-05 23:11:43,809 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 90 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:11:43,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 199 flow [2022-12-05 23:11:43,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 175 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-12-05 23:11:43,810 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-05 23:11:43,810 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-05 23:11:43,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:43,811 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,811 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:43,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:43,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,815 INFO L130 PetriNetUnfolder]: 10/41 cut-off events. [2022-12-05 23:11:43,815 INFO L131 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-12-05 23:11:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 41 events. 10/41 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 3 based on Foata normal form. 2/42 useless extension candidates. Maximal degree in co-relation 100. Up to 21 conditions per place. [2022-12-05 23:11:43,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-05 23:11:43,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:11:43,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 23:11:43,817 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 111 flow [2022-12-05 23:11:43,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:11:43,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:43,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:43,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:11:43,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash -70325062, now seen corresponding path program 1 times [2022-12-05 23:11:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:43,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44475857] [2022-12-05 23:11:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:43,925 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:11:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:43,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44475857] [2022-12-05 23:11:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44475857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:11:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819492216] [2022-12-05 23:11:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:43,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:11:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:11:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:11:43,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:11:43,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:11:43,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:43,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:11:43,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:43,969 INFO L130 PetriNetUnfolder]: 36/81 cut-off events. [2022-12-05 23:11:43,969 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-05 23:11:43,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 81 events. 36/81 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 182 event pairs, 10 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 264. Up to 32 conditions per place. [2022-12-05 23:11:43,970 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 22 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2022-12-05 23:11:43,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 203 flow [2022-12-05 23:11:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:11:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:11:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-05 23:11:43,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2022-12-05 23:11:43,971 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 111 flow. Second operand 5 states and 33 transitions. [2022-12-05 23:11:43,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 203 flow [2022-12-05 23:11:43,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 178 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:43,972 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 119 flow [2022-12-05 23:11:43,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-05 23:11:43,972 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-05 23:11:43,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:43,972 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 119 flow [2022-12-05 23:11:43,973 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:43,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:43,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 119 flow [2022-12-05 23:11:43,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 23 transitions, 119 flow [2022-12-05 23:11:43,976 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-05 23:11:43,976 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:11:43,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 26 events. 5/26 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 67. Up to 11 conditions per place. [2022-12-05 23:11:43,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 119 flow [2022-12-05 23:11:43,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-05 23:11:44,324 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:11:44,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 353 [2022-12-05 23:11:44,325 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 115 flow [2022-12-05 23:11:44,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:11:44,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:44,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:44,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:11:44,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash -114950209, now seen corresponding path program 1 times [2022-12-05 23:11:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:44,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059928242] [2022-12-05 23:11:44,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:11:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:11:44,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:11:44,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059928242] [2022-12-05 23:11:44,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059928242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:11:44,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:11:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:11:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222252314] [2022-12-05 23:11:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:11:44,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:11:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:11:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:11:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:11:44,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:11:44,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 115 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:11:44,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:11:44,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:11:44,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:11:44,862 INFO L130 PetriNetUnfolder]: 44/99 cut-off events. [2022-12-05 23:11:44,862 INFO L131 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2022-12-05 23:11:44,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 99 events. 44/99 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 296 event pairs, 3 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 340. Up to 48 conditions per place. [2022-12-05 23:11:44,863 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 24 selfloop transitions, 4 changer transitions 14/42 dead transitions. [2022-12-05 23:11:44,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 324 flow [2022-12-05 23:11:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:11:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:11:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-12-05 23:11:44,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2022-12-05 23:11:44,864 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 115 flow. Second operand 6 states and 29 transitions. [2022-12-05 23:11:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 324 flow [2022-12-05 23:11:44,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 268 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 23:11:44,865 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 101 flow [2022-12-05 23:11:44,865 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-05 23:11:44,865 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-05 23:11:44,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:11:44,865 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 101 flow [2022-12-05 23:11:44,866 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:11:44,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:11:44,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 101 flow [2022-12-05 23:11:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 101 flow [2022-12-05 23:11:44,869 INFO L130 PetriNetUnfolder]: 6/28 cut-off events. [2022-12-05 23:11:44,869 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 23:11:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 28 events. 6/28 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2022-12-05 23:11:44,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 21 transitions, 101 flow [2022-12-05 23:11:44,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-05 23:11:45,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_148 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_418 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_372 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_419 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_372) v_~x$w_buff1_used~0_371) (= (mod v_~main$tmp_guard1~0_96 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|) (= v_~x$r_buff0_thd0~0_147 (ite .cse1 0 v_~x$r_buff0_thd0~0_148)) (= (ite (= 0 (ite (not (and (= v_~y~0_111 2) (= v_~__unbuffered_p2_EAX~0_77 1) (= v_~__unbuffered_p0_EAX~0_94 0) (= v_~__unbuffered_p2_EBX~0_77 1))) 1 0)) 0 1) v_~main$tmp_guard1~0_96) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (= (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_371 256) 0))) (and .cse3 (not (= 0 (mod v_~x$r_buff0_thd0~0_147 256))))) 0 v_~x$r_buff1_thd0~0_149) v_~x$r_buff1_thd0~0_148) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91| 0) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_51| 0)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_72) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|) (= (ite .cse4 v_~x$w_buff0~0_268 (ite .cse0 v_~x$w_buff1~0_220 v_~x~0_311)) v_~x~0_310) (= (ite .cse4 0 v_~x$w_buff0_used~0_419) v_~x$w_buff0_used~0_418)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_268, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_148, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_94, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_220, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_372, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ~y~0=v_~y~0_111, ~x~0=v_~x~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_419} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_268, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_147, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_77, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~x$w_buff1~0=v_~x$w_buff1~0_220, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_371, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_418, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_94, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_111, ~x~0=v_~x~0_310, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_43|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [442] $Ultimate##0-->L787: Formula: (and (= v_~y~0_107 1) (= v_~x$r_buff0_thd2~0_150 1) (= v_~x$w_buff0_used~0_411 v_~x$w_buff1_used~0_365) (= |v_P1Thread1of1ForFork0_~arg#1.base_44| |v_P1Thread1of1ForFork0_#in~arg#1.base_44|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|) (= v_~x$w_buff0~0_263 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_410 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_365 256) 0)) (not (= (mod v_~x$w_buff0_used~0_410 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_44| |v_P1Thread1of1ForFork0_~arg#1.offset_44|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| 0)) (= v_~x$w_buff0~0_262 1) (= v_~x$r_buff0_thd0~0_141 v_~x$r_buff1_thd0~0_142) (= v_~x$r_buff0_thd3~0_132 v_~x$r_buff1_thd3~0_130) (= v_~x$r_buff0_thd1~0_144 v_~x$r_buff1_thd1~0_142) (= v_~x$r_buff0_thd2~0_151 v_~x$r_buff1_thd2~0_110)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_263, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_151, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_411} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_262, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_44|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_44|, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_130, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_110, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_365, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_142, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_410, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~y~0=v_~y~0_107} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-05 23:11:45,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L836-3-->L787: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff0_thd0~0_152 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_472 256) 0)) .cse0))) (let ((.cse1 (ite .cse2 0 v_~x$w_buff0_used~0_472))) (and (= v_~x$r_buff0_thd0~0_151 v_~x$r_buff1_thd0~0_152) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= v_~x$w_buff0_used~0_470 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~y~0_113 1) (= v_~x$r_buff0_thd1~0_154 v_~x$r_buff1_thd1~0_152) (= v_~x$w_buff0~0_293 v_~x$w_buff1~0_240) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_148) (= v_~x$r_buff0_thd3~0_162 v_~x$r_buff1_thd3~0_160) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= v_~x$r_buff0_thd0~0_151 (ite (and .cse0 (not (= (mod .cse1 256) 0))) 0 v_~x$r_buff0_thd0~0_152)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard0~0_74 (ite (= (ite (= v_~__unbuffered_cnt~0_207 3) 1 0) 0) 0 1)) (= (ite (= 0 (ite (not (and (= v_~y~0_114 2) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p2_EBX~0_79 1) (= v_~__unbuffered_p0_EAX~0_96 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_98) (= (ite .cse2 v_~x$w_buff0~0_293 (ite (and (not (= (mod v_~x$w_buff1_used~0_421 256) 0)) (not (= (mod v_~x$r_buff1_thd0~0_154 256) 0))) v_~x$w_buff1~0_241 v_~x~0_359)) v_~x~0_358) (= v_~x$r_buff0_thd2~0_194 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_46| |v_P1Thread1of1ForFork0_~arg#1.offset_46|) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_470 256))) (not (= (mod v_~x$w_buff1_used~0_419 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|) (= v_~x$w_buff0~0_292 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_46| |v_P1Thread1of1ForFork0_#in~arg#1.base_46|) (= v_~x$w_buff1_used~0_419 .cse1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_293, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_152, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_154, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_241, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_421, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_162, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_154, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_472, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_96, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ~y~0=v_~y~0_114, ~x~0=v_~x~0_359} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_292, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_154, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_46|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_160, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_152, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_50|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_162, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_96, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~y~0=v_~y~0_113, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_50|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_46|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_63|, ~x$w_buff1~0=v_~x$w_buff1~0_240, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_148, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_419, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_152, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_470, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, ~x~0=v_~x~0_358, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~main$tmp_guard0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [441] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= v_~y~0_104 v_~__unbuffered_p2_EAX~0_73) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~__unbuffered_p2_EBX~0_73 v_~y~0_104) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= v_~y~0_103 2)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_104} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_73, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_73, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_103, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:11:45,747 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:11:45,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 882 [2022-12-05 23:11:45,747 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 136 flow [2022-12-05 23:11:45,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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:11:45,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:11:45,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:45,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:11:45,748 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:11:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:11:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1541201640, now seen corresponding path program 1 times [2022-12-05 23:11:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:11:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588646700] [2022-12-05 23:11:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:11:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:11:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:11:45,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:11:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:11:45,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:11:45,879 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:11:45,880 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:11:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:11:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:11:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:11:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:11:45,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:11:45,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:11:45,881 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:11:45,885 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:11:45,885 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:11:45,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:11:45 BasicIcfg [2022-12-05 23:11:45,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:11:45,945 INFO L158 Benchmark]: Toolchain (without parser) took 10379.19ms. Allocated memory was 205.5MB in the beginning and 419.4MB in the end (delta: 213.9MB). Free memory was 178.1MB in the beginning and 340.8MB in the end (delta: -162.8MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2022-12-05 23:11:45,945 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:11:45,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.37ms. Allocated memory is still 205.5MB. Free memory was 178.1MB in the beginning and 151.8MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:11:45,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.38ms. Allocated memory is still 205.5MB. Free memory was 151.8MB in the beginning and 149.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:11:45,946 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 205.5MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:11:45,946 INFO L158 Benchmark]: RCFGBuilder took 568.97ms. Allocated memory is still 205.5MB. Free memory was 147.7MB in the beginning and 115.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:11:45,946 INFO L158 Benchmark]: TraceAbstraction took 9173.62ms. Allocated memory was 205.5MB in the beginning and 419.4MB in the end (delta: 213.9MB). Free memory was 115.2MB in the beginning and 340.8MB in the end (delta: -225.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:11:45,947 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 205.5MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.37ms. Allocated memory is still 205.5MB. Free memory was 178.1MB in the beginning and 151.8MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.38ms. Allocated memory is still 205.5MB. Free memory was 151.8MB in the beginning and 149.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 205.5MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.97ms. Allocated memory is still 205.5MB. Free memory was 147.7MB in the beginning and 115.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9173.62ms. Allocated memory was 205.5MB in the beginning and 419.4MB in the end (delta: 213.9MB). Free memory was 115.2MB in the beginning and 340.8MB in the end (delta: -225.7MB). 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.5s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1474, independent conditional: 1474, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1556, independent: 1474, independent conditional: 0, independent unconditional: 1474, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1556, independent: 1474, independent conditional: 0, independent unconditional: 1474, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1556, independent: 1474, independent conditional: 0, independent unconditional: 1474, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1242, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1242, independent: 1184, independent conditional: 0, independent unconditional: 1184, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1556, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 1242, unknown conditional: 0, unknown unconditional: 1242] , Statistics on independence cache: Total cache size (in pairs): 1898, Positive cache size: 1862, Positive conditional cache size: 0, Positive unconditional cache size: 1862, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 44, 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: 64, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 44, independent conditional: 3, independent unconditional: 41, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 61, dependent conditional: 14, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 60, unknown conditional: 6, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 3, Positive unconditional cache size: 41, Negative cache size: 16, Negative conditional cache size: 3, Negative unconditional cache size: 13, 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, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 3, Positive unconditional cache size: 48, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 57, Positive conditional cache size: 3, Positive unconditional cache size: 54, Negative cache size: 21, Negative conditional cache size: 3, 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, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 57, Positive conditional cache size: 3, Positive unconditional cache size: 54, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 42 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 107, independent conditional: 33, independent unconditional: 74, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 68, Positive conditional cache size: 3, Positive unconditional cache size: 65, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 5, independent unconditional: 13, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 70, Positive conditional cache size: 3, Positive unconditional cache size: 67, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, 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.1s, 39 PlacesBefore, 37 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 26, independent conditional: 26, 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: 44, independent: 26, independent conditional: 8, independent unconditional: 18, 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: 44, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 44, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 44, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 80, Positive conditional cache size: 3, Positive unconditional cache size: 77, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, 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, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, independent unconditional: 5, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 41, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 88, Positive conditional cache size: 6, Positive unconditional cache size: 82, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, 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.3s, 35 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 24, independent unconditional: 16, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 40, independent conditional: 24, independent unconditional: 16, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 40, independent conditional: 24, independent unconditional: 16, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 64, independent: 35, independent conditional: 21, independent unconditional: 14, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 95, Positive conditional cache size: 9, Positive unconditional cache size: 86, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, 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.9s, 35 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 22 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 58, independent conditional: 58, 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: 77, independent: 58, independent conditional: 58, independent unconditional: 0, 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: 77, independent: 58, independent conditional: 58, independent unconditional: 0, 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: 77, independent: 58, independent conditional: 58, independent unconditional: 0, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 126, Positive conditional cache size: 19, Positive unconditional cache size: 107, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-3, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-2, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y [L806] 3 __unbuffered_p2_EBX = y [L744] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 836]: 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: 832]: 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, 133 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: 9.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 8 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=5, InterpolantAutomatonStates: 43, 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.4s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:11:45,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...